Post correspondence problem with partially commutative alphabets

DOI10.1007/978-3-642-13089-2_30MaRDI QIDQ3564877zbMATH OpenOpenAlexFDO

Authors Barbara Klunder, Wojciech Rytter

Publication date 26 May 2010

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13089-2_30

zbMATH Keywords

equality setmorphismpartially commutative alphabetPost correspondence problem (PCP)reversal bounded multicounter machinesolvabilityweak equality set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On some variants of Post's correspondence problem
• Remarks on generalized Post Correspondence Problem
• Post correspondence problem: words possible as primitive solutions
• The Post correspondence problem in groups.
• On the dual Post correspondence problem

Cited in

(4)

• scientific article; zbMATH DE number 3972221 (Why is no real title available?)
• scientific article; zbMATH DE number 4037835 (Why is no real title available?)
• Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
• The Post correspondence problem in groups.

This page was built for publication: Post correspondence problem with partially commutative alphabets

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