paper

Decidability of membership problems for flat rational subsets of and singular matrices

arXiv:1910.02302

Abstract

We consider membership problems for rational subsets of the semigroup of matrices over . For a semigroup , the rational subsets are defined as the sets accepted by NFAs whose transitions are labeled by elements of . In general, it is undecidable on inputs and whether belongs to . Therefore, we restrict our attention to the family of flat rational subsets of over , where is a subsemigroup of . It consists of finite unions of the form , where and . Assuming that the membership for is decidable, we prove various results when the membership for is decidable. If is a subgroup of a group , then we provide a rather general condition when is an (effective) relative Boolean algebra. This leads to one of our main results that the emptiness problem for Boolean combinations of sets in is decidable. It is possible that this result cannot be pushed any further as indicated by the following dichotomy: if is a finitely generated group such that , then either or contains an extension of the Baumslag-Solitar group of infinite index. It is open whether the membership for rational subsets is decidable in the latter case. For singular matrices, we will show that the membership problem for is decidable in doubly exponential time, where is the monoid generated by .

46 pages, 4 figures

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices · wovepaper