Infinite solutions of marked Post correspondence problem

DOI10.1007/3-540-45711-9_4MaRDI QIDQ4738288zbMATH OpenFDO

Authors Vesa Halava, Tero Harju

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2300/23000057.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Thue and Post systems, etc. (03D03) Word problems, etc. in computability and recursion theory (03D40) Formal languages and automata (68Q45)

Recommendations

• The structure of infinite solutions of marked and binary Post correspondence problems
• scientific article; zbMATH DE number 2051181
• Decidability of the binary infinite Post Correspondence Problem
• scientific article; zbMATH DE number 1522564
• scientific article; zbMATH DE number 5074397

Cited in

(7)

• Decidability of the binary infinite Post Correspondence Problem
• The exact complexity of the infinite Post Correspondence Problem
• Extension of the decidability of the marked PCP to instances with unique blocks
• Undecidability of infinite post correspondence problem for instances of Size 9
• scientific article; zbMATH DE number 2051181 (Why is no real title available?)
• scientific article; zbMATH DE number 1522564 (Why is no real title available?)
• The structure of infinite solutions of marked and binary Post correspondence problems

This page was built for publication: Infinite solutions of marked Post correspondence problem

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