The following pages link to (Q5586335):
Displaying 12 items.
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← links)
- On some variants of Post's correspondence problem (Q792770) (← links)
- Variations on the post correspondence problem for free groups (Q832925) (← links)
- The (generalized) Post correspondence problem with lists consisting of two words is decidable (Q1168746) (← links)
- A note on decidability questions on presentations of word semigroups (Q1391138) (← links)
- On fixed points of rational transductions (Q1637233) (← links)
- Computing with quanta -- impacts of quantum theory on computation. (Q1853471) (← links)
- Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
- Extension of the decidability of the marked PCP to instances with unique blocks (Q2373757) (← links)
- Marked PCP is decidable (Q5941069) (← links)
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups (Q6188133) (← links)
