A simple undecidable problem for free groups
| dc.contributor.author | Harju Tero | |
| dc.contributor.organization | fi=matematiikka|en=Mathematics| | |
| dc.contributor.organization-code | 1.2.246.10.2458963.20.41687507875 | |
| dc.converis.publication-id | 404690265 | |
| dc.converis.url | https://research.utu.fi/converis/portal/Publication/404690265 | |
| dc.date.accessioned | 2025-08-27T21:37:26Z | |
| dc.date.available | 2025-08-27T21:37:26Z | |
| dc.description.abstract | Let Fn denote the free group on n generators. It is shown to be undecidable for two morphisms g,h:Fn→F2 and a generator element a of F2, whether or not there exists an element w∈Fn such that g(w)=a and h(w)=1, where 1 is the identity element. | |
| dc.identifier.eissn | 1879-2294 | |
| dc.identifier.jour-issn | 0304-3975 | |
| dc.identifier.olddbid | 200755 | |
| dc.identifier.oldhandle | 10024/183782 | |
| dc.identifier.uri | https://www.utupub.fi/handle/11111/47114 | |
| dc.identifier.url | https://doi.org/10.1016/j.tcs.2024.114629 | |
| dc.identifier.urn | URN:NBN:fi-fe2025082789226 | |
| dc.language.iso | en | |
| dc.okm.affiliatedauthor | Harju, Tero | |
| dc.okm.discipline | 111 Mathematics | en_GB |
| dc.okm.discipline | 111 Matematiikka | fi_FI |
| dc.okm.internationalcopublication | not an international co-publication | |
| dc.okm.internationality | International publication | |
| dc.okm.type | A1 ScientificArticle | |
| dc.publisher | Elsevier | |
| dc.publisher.country | Netherlands | en_GB |
| dc.publisher.country | Alankomaat | fi_FI |
| dc.publisher.country-code | NL | |
| dc.relation.articlenumber | 114629 | |
| dc.relation.doi | 10.1016/j.tcs.2024.114629 | |
| dc.relation.ispartofjournal | Theoretical Computer Science | |
| dc.relation.volume | 1003 | |
| dc.source.identifier | https://www.utupub.fi/handle/10024/183782 | |
| dc.title | A simple undecidable problem for free groups | |
| dc.year.issued | 2024 |
Tiedostot
1 - 1 / 1
Ladataan...
- Name:
- 1-s2.0-S0304397524002445-main.pdf
- Size:
- 342.63 KB
- Format:
- Adobe Portable Document Format