scientific article; zbMATH DE number 4037835

MaRDI QIDQ3778004zbMATH OpenFDO

Authors P. V. Gorshkov, K. V. Arkhangel'Skij

Publication date 1986

zbMATH Keywords

algorithmic insolvabilityPost correspondenceprefix problem

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Automata and formal grammars in connection with logical questions (03D05) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• The Post correspondence problem over a unary alphabet
• Post correspondence problem with partially commutative alphabets
• Post correspondence problem: words possible as primitive solutions
• On some variants of Post's correspondence problem
• On the \(n\)-permutation Post correspondence problem
• On simplest possible solutions for Post Correspondence Problems
• On the dual Post correspondence problem
• On the dual Post correspondence problem
• scientific article; zbMATH DE number 4114608
• Binary (generalized) Post Correspondence Problem

This page was built for publication:

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