A Note on Syndeticity, Recognizable Sets and Cobham's Theorem. - Michel Rigo; Laurent Waxweiler (Bull. EATCS, 2006)

State Complexity of Testing Divisibility - Emilie Charlier; Narad Rampersad; Michel Rigo; Laurent Waxweiler (DCFS, 2010)

Logical Characterization of Recognizable Sets of polynomials over a Finite Field. - Michel Rigo; Laurent Waxweiler (Int. J. Found. Comput. Sci., 2011)

The Minimal Automaton Recognizing mN in a Linear Numeration System. - Émilie Charlier; Narad Rampersad; Michel Rigo; Laurent Waxweiler (Integers, 2011)