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