On some variants of Post's correspondence problem
From MaRDI portal
(Redirected from Publication:792770)
Recommendations
- Publication:4729772
- On the \(n\)-permutation Post correspondence problem
- Some new results on Post correspondence problem and its modifications
- Remarks on generalized Post Correspondence Problem
- On simplest possible solutions for Post Correspondence Problems
- Post's correspondence problem: from computer science to algebra
- scientific article; zbMATH DE number 1522564
- On F-prime solutions of the Post correspondence problem
- The Post correspondence problem over a unary alphabet
- On the dual Post correspondence problem
Cites work
- scientific article; zbMATH DE number 3730118 (Why is no real title available?)
- scientific article; zbMATH DE number 3733281 (Why is no real title available?)
- scientific article; zbMATH DE number 3767068 (Why is no real title available?)
- scientific article; zbMATH DE number 3569843 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3305030 (Why is no real title available?)
- scientific article; zbMATH DE number 3305031 (Why is no real title available?)
- A Remark on Code Sets and Context-Free Languages
- A note on Post's correspondence problem
- Generalized Parikh mappings and homomorphisms
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
Cited in
(21)- More decidable instances of Post's correspondence problem: beyond counting
- Undecidable verification problems for programs with unreliable channels
- scientific article; zbMATH DE number 4037835 (Why is no real title available?)
- Post correspondence problem for short words
- scientific article; zbMATH DE number 1860694 (Why is no real title available?)
- Deterministic semi-Thue systems and variants of Post correspondence problem
- The Post correspondence problem in groups.
- A variant of a recursively unsolvable problem
- Post correspondence problem with partially commutative alphabets
- On bi-infinite and conjugate post correspondence problems
- On the dual Post correspondence problem
- Undecidable problems in unreliable computations.
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups
- On the steps of Emil Post: from normal systems to the correspondence decision problem
- Remarks on generalized Post Correspondence Problem
- Decidability of liveness for concurrent objects on the TSO memory model
- On the \(n\)-permutation Post correspondence problem
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
- scientific article; zbMATH DE number 3976343 (Why is no real title available?)
- New proof for the undecidability of the circular PCP
- On complete one-way functions
This page was built for publication: On some variants of Post's correspondence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792770)
