Improved matrix pair undecidability results
From MaRDI portal
Publication:2641877
DOI10.1007/S00236-007-0047-YzbMATH Open1119.03040OpenAlexW2043603770MaRDI QIDQ2641877FDOQ2641877
Authors: Vesa Halava, Mika Hirvensalo 
Publication date: 17 August 2007
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-007-0047-y
Recommendations
Automata and formal grammars in connection with logical questions (03D05) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- Title not available (Why is that?)
- A variant of a recursively unsolvable problem
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Decision problems for semi-Thue systems with a few rules
- When is a pair of matrices mortal?
- Unsolvability in 3 × 3 Matrices
- Undecidability bounds for integer matrices using Claus instances
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
- Examples of undecidable problems for 2-generator matrix semigroups
- Compactness of Systems of Equations in Semigroups
- Lowering Undecidability Bounds for Decision Questions in Matrices
Cited In (7)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers
- On undecidability bounds for matrix decision problems
- Lowering Undecidability Bounds for Decision Questions in Matrices
- The continuous Skolem-Pisot problem
- Undecidability bounds for integer matrices using Claus instances
- Title not available (Why is that?)
- On Reachability Problems for Low-Dimensional Matrix Semigroups
This page was built for publication: Improved matrix pair undecidability results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641877)
