On the membership of invertible diagonal and scalar matrices

DOI10.1016/j.tcs.2006.11.011zbMath1108.68092OpenAlexW2000305924MaRDI QIDQ870838

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

zbMATH Keywords

undecidabilitymembership problemmatrix semigroupsPost correspondence problemdiagonal matrix

Mathematics Subject Classification ID

Combinatorics on words (68R15) Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40)

Related Items (4)

Products of matrices and recursively enumerable sets ⋮ Reachability problems in quaternion matrix and rotation semigroups ⋮ MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM ⋮ ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mortality in Matrix Semigroups
• UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
• Polynomial-time algorithm for the orbit problem
• Some decision problems on integer matrices
• Mathematical Foundations of Computer Science 2004
• Unsolvability in 3 × 3 Matrices
• Developments in Language Theory

This page was built for publication: On the membership of invertible diagonal and scalar matrices