State Complexity of Testing Divisibility
Formal Languages and Automata Theory
2010-08-11 v1
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.
Cite
@article{arxiv.1008.1668,
title = {State Complexity of Testing Divisibility},
author = {Emilie Charlier and Narad Rampersad and Michel Rigo and Laurent Waxweiler},
journal= {arXiv preprint arXiv:1008.1668},
year = {2010}
}
Comments
In Proceedings DCFS 2010, arXiv:1008.1270