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...
Egile Nagusiak: | Diekert, V, Potapov, I, Semukhin, P |
---|---|
Formatua: | Conference item |
Hizkuntza: | English |
Argitaratua: |
Association for Computing Machinery
2020
|
Antzeko izenburuak
-
Membership problem in GL(2, Z) extended by singular matrices
nork: Potapov, I, et al.
Argitaratua: (2017) -
Decidability of the membership problem for 2 x 2 integer matrices
nork: Potapov, I, et al.
Argitaratua: (2017) -
On the decidability of membership in matrix-exponential semigroups
nork: Ouaknine, J, et al.
Argitaratua: (2019) -
The Competence of the Judicial Authority in Deciding the Validity of Parliamentary Membership
nork: Faysal shatnawy
Argitaratua: (2015-12-01) -
The membership problem for hypergeometric sequences with rational parameters
nork: Nosan, K, et al.
Argitaratua: (2022)