ON THE DUAL POST CORRESPONDENCE PROBLEM

DOI10.1142/S012905411440022XzbMath1317.68127MaRDI QIDQ5247173

Johannes C. Schneider, Daniel Reidenbach, Joel D. Day

Publication date: 23 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

morphismsword equationsambiguity of morphismsdual Post correspondence problemequality setsperiodicity forcing sets

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Binary equality words with two $b$'s

Cites Work

• Weakly unambiguous morphisms
• Morphically primitive words
• P, NP, and the Post correspondence problem
• Periodicity Forcing Words
• INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE
• Large Simple Binary Equality Words
• Equality languages and fixed point languages
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• On the Dual Post Correspondence Problem
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• A variant of a recursively unsolvable problem

This page was built for publication: ON THE DUAL POST CORRESPONDENCE PROBLEM