Flatwords and Post Correspondence Problem

DOI10.1016/0304-3975(95)00092-5zbMath0872.68088OpenAlexW2014930599MaRDI QIDQ1351939

Alexandru Mateescu, Marjo Lipponen, Tero J.Harju

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00092-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Shuffle on trajectories: Syntactic constraints

Cites Work

• A note on Post's correspondence problem
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• On simplest possible solutions for Post Correspondence Problems
• Strongly prime PCP words
• Equality Sets and Complexity Classes
• PCP-prime words and primality types
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item