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...
Những tác giả chính: | Diekert, V, Potapov, I, Semukhin, P |
---|---|
Định dạng: | Conference item |
Ngôn ngữ: | English |
Được phát hành: |
Association for Computing Machinery
2020
|
Những quyển sách tương tự
-
Membership problem in GL(2, Z) extended by singular matrices
Bằng: Potapov, I, et al.
Được phát hành: (2017) -
Decidability of the membership problem for 2 x 2 integer matrices
Bằng: Potapov, I, et al.
Được phát hành: (2017) -
On the decidability of membership in matrix-exponential semigroups
Bằng: Ouaknine, J, et al.
Được phát hành: (2019) -
The Competence of the Judicial Authority in Deciding the Validity of Parliamentary Membership
Bằng: Faysal shatnawy
Được phát hành: (2015-12-01) -
The membership problem for hypergeometric sequences with rational parameters
Bằng: Nosan, K, et al.
Được phát hành: (2022)