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 |
---|---|
格式: | Conference item |
語言: | English |
出版: |
Association for Computing Machinery
2020
|
相似書籍
-
Membership problem in GL(2, Z) extended by singular matrices
由: Potapov, I, et al.
出版: (2017) -
Decidability of the membership problem for 2 x 2 integer matrices
由: Potapov, I, et al.
出版: (2017) -
On the decidability of membership in matrix-exponential semigroups
由: Ouaknine, J, et al.
出版: (2019) -
The Competence of the Judicial Authority in Deciding the Validity of Parliamentary Membership
由: Faysal shatnawy
出版: (2015-12-01) -
The membership problem for hypergeometric sequences with rational parameters
由: Nosan, K, et al.
出版: (2022)