×

Generalized Post correspondence problem for marked morphisms. (English) Zbl 0971.68124

Summary: We prove the Generalized Post Correspondence Problem (GPCP) is decidable for marked morphisms. This result gives as a corollary a shorter proof for the decidability of the binary PCP, proved in 1982 by A. Ehrenfeucht, J. Karhumäki and G. Rozenberg [Theor. Comput. Sci. 21, 119-144 (1982; Zbl 0493.68076)].

MSC:

68R15 Combinatorics on words
68Q70 Algebraic theory of languages and automata
20F10 Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Citations:

Zbl 0493.68076
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1016/0304-3975(89)90080-7 · Zbl 0493.68076 · doi:10.1016/0304-3975(89)90080-7
[2] DOI: 10.1007/3-540-49116-3_19 · doi:10.1007/3-540-49116-3_19
[3] Harju T., Handbook of Formal Languages 1 pp 439–
[4] DOI: 10.1090/S0002-9904-1946-08555-9 · Zbl 0063.06329 · doi:10.1090/S0002-9904-1946-08555-9
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.