Decidability of membership problems for flat rational subsets of GL (2, Q) and singular matrices
<p>This work relates numerical problems on matrices over the rationals to symbolic algorithms on words and finite automata. Using exact algebraic algorithms and symbolic computation, we prove new decidability results for 2 × 2 matrices over Q. Namely, we introduce a notion of flat rational set...
Main Authors: | Diekert, V, Potapov, I, Semukhin, P |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Association for Computing Machinery
2020
|
Similar Items
-
Membership problem in GL(2, Z) extended by singular matrices
by: Potapov, I, et al.
Published: (2017) -
Decidability of the membership problem for 2 x 2 integer matrices
by: Potapov, I, et al.
Published: (2017) -
On the decidability of membership in matrix-exponential semigroups
by: Ouaknine, J, et al.
Published: (2019) -
The membership problem for hypergeometric sequences with rational parameters
by: Nosan, K, et al.
Published: (2022) -
GL(n, q)-analogues of factorization problems in the symmetric group
by: Joel Brewster Lewis, et al.
Published: (2020-04-01)