scientific article; zbMATH DE number 2051181

MaRDI QIDQ4453473zbMATH OpenFDO

Authors Vesa Halava

Publication date 7 March 2004

zbMATH Keywords

decidability proof

Mathematics Subject Classification ID

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

Recommendations

• Decidability of the binary infinite Post Correspondence Problem
• scientific article; zbMATH DE number 2087488
• The structure of infinite solutions of marked and binary Post correspondence problems
• scientific article; zbMATH DE number 1522564
• Undecidability of infinite post correspondence problem for instances of Size 9

Cited in

(15)

• Two decidability problems for infinite words
• Decidability of the binary infinite Post Correspondence Problem
• Binary (generalized) Post Correspondence Problem
• On Post correspondence problem for letter monotonic languages
• The exact complexity of the infinite Post Correspondence Problem
• Extension of the decidability of the marked PCP to instances with unique blocks
• Some new results on Post correspondence problem and its modifications
• Undecidability of infinite Post correspondence problem for instances of size 8
• scientific article; zbMATH DE number 3856427 (Why is no real title available?)
• Undecidability of infinite post correspondence problem for instances of Size 9
• scientific article; zbMATH DE number 3976343 (Why is no real title available?)
• scientific article; zbMATH DE number 2087488 (Why is no real title available?)
• scientific article; zbMATH DE number 7724207 (Why is no real title available?)
• The structure of infinite solutions of marked and binary Post correspondence problems
• More decidable instances of Post's correspondence problem: beyond counting

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 Q4453473)