Abstract
The following universe problem for the equality sets is shown to be undecidable: given a weak coding h, and two morphisms g1, g2, where g2 is periodic, determine whether or not h(EG(g1, g2)) = σ+, where EG(g1, g2) consists of the solutions w to the equation g1(w) = #g2(w) for a fixed letter #. The problem is trivially decidable, if instead of EG(g1, g2) the equality set E(g1, g2) (without a marker symbol #) is chosen. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Halava, V., & Harju, T. (2002). An undecidability result concerning periodic morphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2295 LNCS, pp. 304–310). Springer Verlag. https://doi.org/10.1007/3-540-46011-x_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
