Strongly prime PCP words

DOI10.1016/0166-218X(95)00064-XMaRDI QIDQ1902906zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• PCP-prime words and primality types
• Post correspondence problem: words possible as primitive solutions
• On F-prime solutions of the Post correspondence problem
• scientific article; zbMATH DE number 1860694
• Decision problems concerning prime words and languages of the Post Correspondence Problems

Cites work

• scientific article; zbMATH DE number 604881 (Why is no real title available?)
• scientific article; zbMATH DE number 10092 (Why is no real title available?)
• On F-prime solutions of the Post correspondence problem
• On simplest possible solutions for Post Correspondence Problems
• PCP-prime words and primality types
• Test sets and checking words for homomorphism equivalence

Cited in

(5)

• On F-prime solutions of the Post correspondence problem
• Flatwords and Post Correspondence Problem
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• Discontinuities in pattern inference
• The unambiguity of segmented morphisms

This page was built for publication: Strongly prime PCP words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902906)