Cassaigne, J., Labbé, S., & Leroy, J. (2022). Almost everywhere balanced sequences of complexity 2n+1. Moscow Journal of Combinatorics and Number Theory. |
Durand, F., & Leroy, J. (2022). Decidability of the isomorphism and the factorization between minimal substitution subshifts. Discrete Analysis. doi:10.19086/da.36901 |
Gheeraert, F., & Leroy, J. (2022). S-adic characterization of minimal dendric shifts. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/313037. |
Gheeraert, F., Lejeune, M., & Leroy, J. (2021). S-adic characterization of minimal ternary dendric shifts. Ergodic Theory and Dynamical Systems. doi:10.1017/etds.2021.84 |
Berthé, V., Bernales, P. C., Durand, F., Leroy, J., Perrin, D., & Petite, S. (2020). On The Dimension Group of Unimodular S-Adic Subshifts. Monatshefte für Mathematik. doi:10.1007/s00605-020-01488-3 |
Lejeune, M., Leroy, J., & Rigo, M. (2020). Computing the k-binomial complexity of the Thue–Morse word. Journal of Combinatorial Theory. Series A, 176. doi:10.1016/j.jcta.2020.105284 |
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 |
Berthé, V., Dolce, F., Durand, F., Leroy, J., & Perrin, D. (2018). Rigidity and substitutive dendric words. International Journal of Foundations of Computer Science, 29 (5), 705-720. doi:10.1142/S0129054118420017 |
Charlier, E., Ernst, M., Esser, C., Haine, Y., Lacroix, A., Leroy, J., Raskin, J., & Swan, Y. (Eds.). (2018). MATh.en.JEANS. MATh.en.JEANS.be. |
Leroy, J., Rigo, M., & Stipulanti, M. (2018). Counting Subwords Occurrences in Base-b Expansions. Integers, 18A, 13, 32. |
Berthé, V., De Felice, C., Delecroix, V., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (July 2017). Specular sets. Theoretical Computer Science, 684, 3-28. doi:10.1016/j.tcs.2017.03.001 |
Leroy, J., Rigo, M., & Stipulanti, M. (03 March 2017). Behavior of digital sequences through exotic numeration systems. Electronic Journal of Combinatorics, 24 (1), 1.44, 36. doi:10.37236/6581 |
Durand, F., & Leroy, J. (February 2017). The constant of recognizability is computable for primitive morphisms. Journal of Integer Sequences, 20 (4). |
Leroy, J., Rigo, M., & Stipulanti, M. (2017). Counting the number of non-zero coefficients in rows of generalized Pascal triangles. Discrete Mathematics, 340, 862-881. doi:10.1016/j.disc.2017.01.003 |
Dolce, F., Kyriakoglou, R., & Leroy, J. (2016). Decidable properties of extension graphs for substitutive languages. In Local proceedings of Mons Theoretical Computer Science Days. |
Charlier, E., Leroy, J., & Rigo, M. (01 July 2016). Asymptotic properties of free monoid morphisms. Linear Algebra and its Applications, 500, 119-148. doi:10.1016/j.laa.2016.02.030 |
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 |
Leroy, J., Rigo, M., & Stipulanti, M. (2016). Generalized Pascal triangle for binomial coefficients of words. Advances in Applied Mathematics, 80, 24-47. doi:10.1016/j.aam.2016.04.006 |
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 |
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). The finite index basis property. Journal of Pure and Applied Algebra, 219 (7), 2521–2537. doi:10.1016/j.jpaa.2014.09.014 |
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). Maximal bifix decoding. Discrete Mathematics, 338 (5), 725–742. doi:10.1016/j.disc.2014.12.010 |
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). Bifix codes and interval exchanges. Journal of Pure and Applied Algebra, 219 (7), 2781–2798. doi:10.1016/j.jpaa.2014.09.028 |
Berthé, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., & Rindone, G. (2015). Acyclic, connected and tree sets. Monatshefte für Mathematik, 176 (4), 521–550. doi:10.1007/s00605-014-0721-4 |
Charlier, E., Leroy, J., & Rigo, M. (2015). An analogue of Cobham's theorem for graph directed iterated function systems. Advances in Mathematics, 280, 86-120. doi:10.1016/j.aim.2015.04.008 |
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. |
Leroy, J. (2014). An $S$-adic characterization of minimal subshifts with first difference of complexity $1 p(n+1)-p(n)\le2$. Discrete Mathematics and Theoretical Computer Science, 16 (1), 233-286. |
Durand, F., Leroy, J., & Richomme, G. (March 2013). Do the properties of an $S$-adic representation determine factor complexity? Journal of Integer Sequences, 16 (2), 13.2.6, 30. |
Leroy, J., & Richomme, G. (January 2013). A combinatorial proof of S-adicity for sequences with linear complexity. Integers, 13, 5, 19. |
Durand, F., & Leroy, J. (October 2012). $S$-adic conjecture and Bratteli diagrams. Comptes Rendus de l'Académie des Sciences. Série I. Mathématique, 350 (21-22), 979-983. doi:10.1016/j.crma.2012.10.015 |
Leroy, J. (January 2012). Some improvements of the S-adic conjecture. Advances in Applied Mathematics, 48 (1), 79-98. doi:10.1016/j.aam.2011.03.005 |
Leroy, J. (2012). Contribution à la résolution de la conjecture S-adique [Doctoral thesis, UPJV - Université de Picardie Jules Verne]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/192373 |
Leroy, J. (2011). Examples and counter-examples about the S-adic conjecture. In Local proceedings of Numeration 2011. |
Leroy, J. (2010). Some improvements of the S-adic conjecture (extended abstract). In Local proceedings of Mons Theoretical Computer Science Days. |
Leroy, J. (2008). Les systèmes de numération en base rationnelle [Master’s dissertation, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/221860 |
Leroy, J. (2007). Les groupes automatiques [Master’s dissertation, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/221861 |