A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
A simple undecidable problem for free groups
Tekijät: Harju Tero
Kustantaja: Elsevier
Julkaisuvuosi: 2024
Journal: Theoretical Computer Science
Tietokannassa oleva lehden nimi: Theoretical Computer Science
Artikkelin numero: 114629
Vuosikerta: 1003
ISSN: 0304-3975
eISSN: 1879-2294
DOI: https://doi.org/10.1016/j.tcs.2024.114629
Verkko-osoite: https://doi.org/10.1016/j.tcs.2024.114629
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/404690265
Tiivistelmä
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.
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.
Ladattava julkaisu This is an electronic reprint of the original article. |