On the Size of Finite Rational Matrix Semigroups
Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu,, Jonathan Tanner

TL;DR
This paper establishes an upper bound on the length of products needed to generate any matrix in a finite rational matrix semigroup, enabling efficient algorithms for automata finiteness and reachability problems.
Contribution
It provides a new exponential bound on matrix product length in finite rational matrix semigroups, leading to elementary algorithms for related decision problems.
Findings
Bound on product length is at most exponential in n^2 log n.
Algorithms for automata finiteness are now elementary.
Decidability of reachability in affine integer systems with finite monoids.
Abstract
Let be a positive integer and a set of rational -matrices such that generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in whose length is at most , where is the maximum order of finite groups over rational -matrices. This result implies algorithms with an elementary running time for deciding finiteness of weighted automata over the rationals and for deciding reachability in affine integer vector addition systems with states with the finite monoid property.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
