The invariance problem for matrix semigroups
From MaRDI portal
Publication:2811359
Recommendations
- On undecidability bounds for matrix decision problems
- Lowering Undecidability Bounds for Decision Questions in Matrices
- Vector reachability problem in \(\operatorname{SL}(2,\mathbb{Z})\)
- Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
- scientific article; zbMATH DE number 7559115
Cites work
- scientific article; zbMATH DE number 42574 (Why is no real title available?)
- Developments in Language Theory
- On the reachability problem for 5-dimensional vector addition systems
- Parallel program schemata
- Polynomial-time algorithm for the orbit problem
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- Reachability in register machines with polynomial updates
- Reachability problems for PAMs
- The boundedness of all products of a pair of matrices is undecidable
- Undecidability bounds for integer matrices using Claus instances
Cited in
(5)- scientific article; zbMATH DE number 2196226 (Why is no real title available?)
- Lowering Undecidability Bounds for Decision Questions in Matrices
- scientific article; zbMATH DE number 3868502 (Why is no real title available?)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers
- THE FINITE BASIS PROBLEM FOR INVOLUTION SEMIGROUPS OF TRIANGULAR MATRICES
This page was built for publication: The invariance problem for matrix semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811359)