Post Correspondence Problem and Small Dimensional Matrices
From MaRDI portal
Recommendations
Cites work
- A variant of a recursively unsolvable problem
- Decision problems for semi-Thue systems with a few rules
- Developments in Language Theory
- Examples of undecidable problems for 2-generator matrix semigroups
- scientific article; zbMATH DE number 3730118 (Why is no real title available?)
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
- Mortality of 2 × 2 Matrices
- On Markov's undecidability theorem for integer matrices.
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
- ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
- On undecidability bounds for matrix decision problems
- Post correspondence problem for short words
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
- Undecidability bounds for integer matrices using Claus instances
- Unsolvability in 3 × 3 Matrices
- When is a pair of matrices mortal?
Cited in
(3)
This page was built for publication: Post Correspondence Problem and Small Dimensional Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637212)