A1 Refereed original research article in a scientific journal
A simple undecidable problem for free groups
Authors: Harju Tero
Publisher: Elsevier
Publication year: 2024
Journal: Theoretical Computer Science
Journal name in source: Theoretical Computer Science
Article number: 114629
Volume: 1003
ISSN: 0304-3975
eISSN: 1879-2294
DOI: https://doi.org/10.1016/j.tcs.2024.114629
Web address : https://doi.org/10.1016/j.tcs.2024.114629
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/404690265
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.
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.
Downloadable publication This is an electronic reprint of the original article. |