The Invariance Problem for Matrix Semigroups

DOI10.1007/978-3-662-49630-5_28zbMath1476.20060OpenAlexW2504887362MaRDI QIDQ2811359

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

Mathematics Subject Classification ID

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)

Related Items (1)

Reachability problems in low-dimensional nondeterministic polynomial maps over integers

Uses Software

• Easychair

Cites Work

• Unnamed Item
• On the reachability problem for 5-dimensional vector addition systems
• The boundedness of all products of a pair of matrices is undecidable
• Parallel program schemata
• Reachability Problems for PAMs
• Reachability in Register Machines with Polynomial Updates
• UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
• Polynomial-time algorithm for the orbit problem
• REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
• Developments in Language Theory

This page was built for publication: The Invariance Problem for Matrix Semigroups