Post Correspondence Problem with Partially Commutative Alphabets

DOI10.1007/978-3-642-13089-2_30zbMath1284.68355OpenAlexW1497947644MaRDI QIDQ3564877

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

solvabilitymorphismequality setpartially commutative alphabetPost correspondence problem (PCP)reversal bounded multicounter machineweak equality set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: Post Correspondence Problem with Partially Commutative Alphabets