scientific article; zbMATH DE number 3305031
From MaRDI portal
Publication:5586335
Cited in
(13)- The (generalized) Post correspondence problem with lists consisting of two words is decidable
- A note on decidability questions on presentations of word semigroups
- On fixed points of rational transductions
- Computing with quanta -- impacts of quantum theory on computation.
- Word problem for deterministic and reversible semi-Thue systems
- Extension of the decidability of the marked PCP to instances with unique blocks
- New proof for the undecidability of the circular PCP
- On the \(n\)-permutation Post correspondence problem
- Marked PCP is decidable
- Post's correspondence problem: from computer science to algebra
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups
- On some variants of Post's correspondence problem
- Variations on the post correspondence problem for free groups
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 Q5586335)
