A1 Refereed original research article in a scientific journal

A simple undecidable problem for free groups




AuthorsHarju Tero

PublisherElsevier

Publication year2024

JournalTheoretical Computer Science

Journal name in sourceTheoretical Computer Science

Article number114629

Volume1003

ISSN0304-3975

eISSN1879-2294

DOIhttps://doi.org/10.1016/j.tcs.2024.114629

Web address https://doi.org/10.1016/j.tcs.2024.114629

Self-archived copy’s web addresshttps://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.

Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.





Last updated on 2024-26-11 at 11:53