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...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy: Diekert, V, Potapov, I, Semukhin, P
Format: Conference item
Język:English
Wydane: Association for Computing Machinery 2020

Podobne zapisy