4 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.FL2010★ 1 cited
State Complexity of Testing Divisibility
Emilie Charlier, Narad Rampersad, Michel Rigo +1
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…
cs.FL2010★ 4 cited
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems
Ian McQuillan, Giovanni Pighizzini
The 12th annual workshop, Descriptional Complexity of Formal Systems 2010, is taking place in Saskatoon, Canada, on August 8-10, 2010. It is jointly organized by the IFIP Working G…
cs.FL2009★ 2 cited
A note on syndeticity, recognizable sets and Cobham's theorem
M. Rigo, L. Waxweiler
In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-reco…