scientific article; zbMATH DE number 4114608
From MaRDI portal
zbMATH Open0681.03024MaRDI QIDQ4729772FDOQ4729772
Authors: C. Câmpeanu 
Publication date: 1989
Title of this publication is not available (Why is that?)
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
Thue and Post systems, etc. (03D03) Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40)
Cited In (9)
- More decidable instances of Post's correspondence problem: beyond counting
- Title not available (Why is that?)
- On the steps of Emil Post: from normal systems to the correspondence decision problem
- Remarks on generalized Post Correspondence Problem
- Recursive unsolvability of a problem of Thue
- On the \(n\)-permutation Post correspondence problem
- New proof for the undecidability of the circular PCP
- An explicit solution to Post's problem over the reals
- On some variants of Post's correspondence problem
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)
