scientific article; zbMATH DE number 1522564

MaRDI QIDQ4510798zbMATH OpenFDO

Authors Vesa Halava

Publication date 13 March 2001

zbMATH Keywords

marked morphismsPost correspondence problemword monoid

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

• Generalized Post correspondence problem for marked morphisms
• scientific article; zbMATH DE number 2087488
• Publication:4934339
• Marked PCP is decidable
• scientific article; zbMATH DE number 1304321

Cited in

(14)

• On Post correspondence problem for letter monotonic languages
• Extension of the decidability of the marked PCP to instances with unique blocks
• Generalized Post correspondence problem for marked morphisms
• Some new results on Post correspondence problem and its modifications
• Binary morphisms with stable suffix complexity
• scientific article; zbMATH DE number 3856427 (Why is no real title available?)
• scientific article; zbMATH DE number 1304321 (Why is no real title available?)
• scientific article; zbMATH DE number 2051181 (Why is no real title available?)
• Remarks on generalized Post Correspondence Problem
• scientific article; zbMATH DE number 2087488 (Why is no real title available?)
• scientific article; zbMATH DE number 1390073 (Why is no real title available?)
• Marked PCP is decidable
• On some variants of Post's correspondence problem
• The structure of infinite solutions of marked and binary Post correspondence problems

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