An Undecidability Result Concerning Periodic Morphisms

Authors:
Vesa Halava;Tero Harju
Affiliations:
-;-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 7
Cited 1

Undecidability in integer weighted finite automata

Fundamenta Informaticae - Special issue dedicated to A. Salomaa
An Infinite Hierarchy of Context-Free Languages

Journal of the ACM (JACM)
Handbook of Formal Languages

Handbook of Formal Languages
Remarks on Generalized Post Correspondence Problem

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Decision Problems for Semi-Thue Systems with a Few Rules

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Binary (Generalized) Post Correspondence Problem

Binary (Generalized) Post Correspondence Problem
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences

Valence languages generated by equality sets

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.