The Minimal Automaton Recognizing mN in a Linear Numeration System.
Integers, 2011
Logical Characterization of Recognizable Sets of polynomials over a Finite Field.
Int. J. Found. Comput. Sci., 2011
State Complexity of Testing Divisibility
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010
A Note on Syndeticity, Recognizable Sets and Cobham's Theorem.
Bull. EATCS, 2006