scientific article; zbMATH DE number 4114608

MaRDI QIDQ4729772zbMATH OpenFDO

Authors C. Câmpeanu

Publication date 1989

zbMATH Keywords

semi-Thue algorithmssemi-Thue systemsword problem in monoids

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• Deterministic semi-Thue systems and variants of Post correspondence problem
• New proof for the undecidability of the circular PCP
• Decision problems for semi-Thue systems with a few rules
• Word problem for deterministic and reversible semi-Thue systems
• On the \(n\)-permutation Post correspondence problem

Cited in

(9)

• An explicit solution to Post's problem over the reals
• scientific article; zbMATH DE number 4037835 (Why is no real title available?)
• New proof for the undecidability of the circular PCP
• Remarks on generalized Post Correspondence Problem
• Recursive unsolvability of a problem of Thue
• On the \(n\)-permutation Post correspondence problem
• On the steps of Emil Post: from normal systems to the correspondence decision problem
• On some variants of Post's correspondence problem
• 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 Q4729772)