scientific article; zbMATH DE number 2051181

zbMATH Open1051.03033MaRDI QIDQ4453473FDOQ4453473

Authors: Vesa Halava 

Publication date: 7 March 2004

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

decidability proof

Mathematics Subject Classification ID

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

Cited In (14)

• Title not available (Why is that?)
• More decidable instances of Post's correspondence problem: beyond counting
• Decidability of the binary infinite Post Correspondence Problem
• Some new results on Post correspondence problem and its modifications
• On Post correspondence problem for letter monotonic languages
• Binary (generalized) Post Correspondence Problem
• The structure of infinite solutions of marked and binary Post correspondence problems
• Extension of the decidability of the marked PCP to instances with unique blocks
• Undecidability of infinite Post correspondence problem for instances of size 8
• Undecidability of infinite post correspondence problem for instances of Size 9
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two decidability problems for infinite words

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)