Charlier, E., Leroy, J., & Rigo, M. (2019). Preface. In Special issue: Developments in Language Theory (DLT 2017). World Scientific Publishing Company. doi:10.1142/S0129054119020015
Lejeune, M., Leroy, J., & Rigo, M. (2019). Computing the k-binomial complextiy of the Thue-Morse word. Lecture Notes in Computer Science, 11647, 278-291. doi:10.1007/978-3-030-24886-4_21
Two finite words are k-binomially equivalent whenever they share the same subwords, i.e., subsequ...
Peer reviewed
Charlier, E., Leroy, J., & Rigo, M. (2017). Preface. In Developments in Language Theory. Springer Verlag. doi:10.1007/978-3-319-62809-7
Cassaigne, J., Labbé, S., & Leroy, J. (2017). A set of sequences of complexity $2n+1$. In Combinatorics on words (pp. 144-156). Springer, Cham. doi:10.1007/978-3-319-66396-8_14
Peer reviewed
Charlier, E., Leroy, J., & Rigo, M. (2017). Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique". In special issue RAIRO ITA (pp. 167). EDP Sciences. doi:10.1051/ita/2018001
Dolce, F., Kyriakoglou, R., & Leroy, J. (2016). Decidable properties of extension graphs for substitutive languages. In Local proceedings of Mons Theoretical Computer Science Days.
Peer reviewed
Labbé, S., & Leroy, J. (2016). Bispecial Factors in the Brun S-Adic System. In S. V. Brlek & C. Reutenauer (Eds.), Developments in Language Theory: 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings (pp. 280-292). Berlin, Heidelberg, Germany: Springer Berlin Heidelberg. doi:10.1007/978-3-662-53132-7_23
Peer reviewed
Berthé, V., Felice, C., Delecroix, V., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). Specular sets. In F. Manea & D. Nowotka (Eds.), Combinatorics on Words: 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings (pp. 210-222). Cham, Germany: Springer International Publishing. doi:10.1007/978-3-319-23660-5_18
Peer reviewed
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2014). Return words in tree sets. In Local proceedings of Mons Theoretical Computer Science Days.
Peer reviewed
Leroy, J. (2011). Examples and counter-examples about the S-adic conjecture. In Local proceedings of Numeration 2011.
Peer reviewed
Leroy, J. (2010). Some improvements of the S-adic conjecture (extended abstract). In Local proceedings of Mons Theoretical Computer Science Days.
