scientific article; zbMATH DE number 7204378
From MaRDI portal
Publication:5111259
Formal languages and automata (68Q45) Matrices of integers (15B36) Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic systems of matrices (15A30) Linear algebraic groups over finite fields (20G40) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Recommendations
- Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices
- The conjugacy problem in \(\mathrm{ Gl } ( n, \mathbb{Z} )\)
- Singular matrices and a uniform bound for congruence groups of \(SL_ n(\mathbb{Z})\)
- Matrix semigroup freeness problems in \(\mathrm{SL}(2,\mathbb {Z})\)
- Conjugacy Problem in GL 2 (Z[ √-1 ]) and Units of Quadratic Extensions of Q(√-1)
- The 1-eigenspace for matrices in \(\mathrm{GL}_{2}(\mathbb Z_{\ell})\)
- Singular Gelfand-Tsetlin modules of \(\mathfrak{gl}(n)\)
- scientific article; zbMATH DE number 177176
- The subconvexity problem for \(\mathrm{GL}_2\)
Cites work
- scientific article; zbMATH DE number 6677405 (Why is no real title available?)
- scientific article; zbMATH DE number 3563392 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 3585537 (Why is no real title available?)
- scientific article; zbMATH DE number 871949 (Why is no real title available?)
- Decidability of the membership problem for \(2\times 2\) integer matrices
- Decidable and Undecidable Problems about Quantum Automata
- Mathematical Foundations of Computer Science 2004
- Membership Problem for the Modular Group
- Mortality Problem for 2×2 Integer Matrices
- Mortality for \(2 \times 2\) matrices is NP-hard
- On termination of integer linear loops
- On the computational complexity of matrix semigroup problems
- On the positivity problem for simple linear recurrence sequences
- On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
- On undecidability bounds for matrix decision problems
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Polynomial-time algorithm for the orbit problem
- Post correspondence problem for short words
- Some decision problems on integer matrices
- The identity problem for matrix semigroups in \(\mathrm{SL}_2(\mathbb{Z})\) is NP-complete
- Ultimate positivity is decidable for simple linear recurrence sequences
- Unsolvability in 3 × 3 Matrices
- Vector reachability problem in \(\operatorname{SL}(2,\mathbb{Z})\)
Cited in
(12)- Developments in Language Theory
- Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\)
- Decidability of the membership problem for \(2\times 2\) integer matrices
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
- Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- Reachability problems for one-dimensional piecewise affine maps
- Solving the membership problem for parabolic Möbius monoids
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- On the membership of invertible diagonal and scalar matrices
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
- On Reachability Problems for Low-Dimensional Matrix Semigroups
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111259)
