Post correspondence problem: Words possible as primitive solutions

DOI10.1007/3-540-60084-1_63zbMath1415.03048OpenAlexW1529388494MaRDI QIDQ4645167

Marjo Lipponen

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_63

zbMATH Keywords

finite typeprimitive wordbinary alphabetprime solution

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• On simplest possible solutions for Post Correspondence Problems
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• PCP-prime words and primality types
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Post correspondence problem: Words possible as primitive solutions