A note on Post's correspondence problem
From MaRDI portal
Cited in
(10)- Representations of language families by homomorphic equality operations and generalized equality sets
- Some undecidable termination problems for semi-Thue systems
- Unsolvable algorithmic problems for semigroups, groups and rings
- Frontier between decidability and undecidability: A survey
- When is a pair of matrices mortal?
- Word problem for deterministic and reversible semi-Thue systems
- Successful visual human-computer interaction is undecidable
- Flatwords and Post Correspondence Problem
- An undecidable problem for countable markov chains
- On some variants of Post's correspondence problem
This page was built for publication: A note on Post's correspondence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1164045)