PCP-prime words and primality types

DOI10.1051/ita/1993270100571zbMath0770.68082OpenAlexW185131448MaRDI QIDQ5286055

Alexandru Mateescu, Arto Salomaa

Publication date: 29 June 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92438

zbMATH Keywords

Post Correspondence Problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Flatwords and Post Correspondence Problem ⋮ Strongly prime PCP words ⋮ Post correspondence problem: Words possible as primitive solutions ⋮ On simplest possible solutions for Post Correspondence Problems

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Test sets and checking words for homomorphism equivalence
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item

This page was built for publication: PCP-prime words and primality types