On the membership of invertible diagonal and scalar matrices
From MaRDI portal
Publication:870838
DOI10.1016/J.TCS.2006.11.011zbMATH Open1108.68092OpenAlexW2000305924MaRDI QIDQ870838FDOQ870838
Authors: Igor Potapov, Paul C. Bell 
Publication date: 15 March 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.011
Recommendations
- Developments in Language Theory
- Decidability of the membership problem for \(2\times 2\) integer matrices
- scientific article; zbMATH DE number 7204378
- On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
- Examples of undecidable problems for 2-generator matrix semigroups
Combinatorics on words (68R15) Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40)
Cites Work
- Title not available (Why is that?)
- Unsolvability in 3 × 3 Matrices
- Undecidability bounds for integer matrices using Claus instances
- Polynomial-time algorithm for the orbit problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mortality in Matrix Semigroups
- Some decision problems on integer matrices
- Mathematical Foundations of Computer Science 2004
- Developments in Language Theory
Cited In (6)
- Developments in Language Theory
- On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
- Reachability problems in quaternion matrix and rotation semigroups
- Products of matrices and recursively enumerable sets
- On the decidability of membership in matrix-exponential semigroups
This page was built for publication: On the membership of invertible diagonal and scalar matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870838)
