  | Charlier, E., Lacroix, A., & Rampersad, N. (2012). Multi-dimensional sets recognizable in all abstract numeration systems. RAIRO: Informatique Théorique et Applications, 46 (1), 51-65. doi:10.1051/ita/2011112  Peer Reviewed verified by ORBi |
  | Domaratzki, M., & Rampersad, N. (2011). Abelian primitive words. In G. Mauri & A. Leporati (Eds.), DLT 2011 - Developments in Language Theory. Springer. Peer reviewed |
 | Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2011). The minimal automaton recognizing mN in a linear numeration system. Integers, 11B (A4), 1-24. Peer Reviewed verified by ORBi |
 | Rampersad, N., Shallit, J., & Wang, M.-W. (2011). Inverse star, borders, and palstars. Information Processing Letters, 111, 420-422. doi:10.1016/j.ipl.2011.01.018 Peer Reviewed verified by ORBi |
 | Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). Structure of the minimal automaton of a numeration language. In Actes de LaCIM 2010. Peer reviewed |
 | Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). State complexity of testing divisibility. Electronic Proceedings in Theoretical Computer Science, 31, 48-57. doi:10.4204/EPTCS.31 Peer Reviewed verified by ORBi |
 | Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). Structure of the minimal automaton of a numeration language and applications to state complexity. In Actes des Journées Montoises d'Informatique Théorique. Peer reviewed |