Strongly prime PCP words

DOI10.1016/0166-218X(95)00064-XzbMath0839.68055OpenAlexW1983222532MaRDI QIDQ1902906

Marjo Lipponen, Gheorghe Păun

Publication date: 3 December 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00064-x

zbMATH Keywords

finite alphabetsequality set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Flatwords and Post Correspondence Problem ⋮ Discontinuities in pattern inference ⋮ The unambiguity of segmented morphisms ⋮ UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Test sets and checking words for homomorphism equivalence
• On simplest possible solutions for Post Correspondence Problems
• PCP-prime words and primality types

This page was built for publication: Strongly prime PCP words