State Complexity of Testing Divisibility
arXiv:1008.1668 · doi:10.4204/EPTCS.31.7
Abstract
Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of the trim minimal automaton accepting the greedy representations of the multiples of m in the Fibonacci system is exactly 2m^2.
arXiv commentIn Proceedings DCFS 2010, arXiv:1008.1270