The invariance problem for matrix semigroups
DOI10.1007/978-3-662-49630-5_28zbMATH Open1476.20060OpenAlexW2504887362MaRDI QIDQ2811359FDOQ2811359
Authors: Klaus Dräger 
Publication date: 10 June 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49630-5_28
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
Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic systems of matrices (15A30) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Linear transformations, semilinear transformations (15A04)
Cites Work
- Parallel program schemata
- Title not available (Why is that?)
- The boundedness of all products of a pair of matrices is undecidable
- On the reachability problem for 5-dimensional vector addition systems
- Undecidability bounds for integer matrices using Claus instances
- Polynomial-time algorithm for the orbit problem
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- Reachability in Register Machines with Polynomial Updates
- Developments in Language Theory
- Reachability Problems for PAMs
Cited In (5)
Uses Software
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)
