Leroy, J. (2022). Understanding dendricity through S-adic expansions [Paper presentation]. Mons theoretical Computer Science Days 2022, Prague, Czechia.
Leroy, J. (15 January 2021). Factorisation de sous-shifts substitutifs minimaux [Paper presentation]. Séminaire Teichmuller, Marseille, France.
Leroy, J. (2021). Rauzy graphs, S-adicity and dendricity [Paper presentation]. Words 2021, Rouen, France.
Leroy, J. (September 2020). Minimal dendric subshifts [Paper presentation]. Mons theoretical computer sciences days, Prague, Czechia.
Leroy, J. (September 2020). Nombres irrationnels: représentations périodiques et géométriques [Paper presentation]. Belgian Summer School of Mathematics, Bruxelles, Belgium.
Leroy, J. (July 2020). Factor complexity of minimal S-adic subshifts [Paper presentation]. Dyadisc 4, Open problems for weak complexity dynamical systems, Amiens, France.
Leroy, J. (20 March 2020). Sous-shifts dendriques et automorphismes du groupe libre [Paper presentation]. Séminaire Pytheas Fogg, Marseille, France.
Leroy, J. (December 2019). Graphes de Rauzy et complexité linéaire [Paper presentation]. Journées seqBIM.
Leroy, J. (October 2019). Un théorème de Cobham pour les attracteurs d’IFS [Paper presentation]. Journées du GdR Analyse Multifractale.
Leroy, J. (July 2019). Decidability of the isomorphism and the factorization between minimal substitution subshifts [Paper presentation]. Dyadisc3 : Decidability and dynamical systems.
Leroy, J. (June 2019). Decidability of the isomorphism and the factorization between minimal substitution subshifts [Paper presentation]. Journées SDA2 2019 : Systèmes Dynamiques, Automates & Algorithmes, Orsay, France.
Leroy, J. (10 January 2019). Decidability of the isomorphism and the factorization between minimal substitution subshifts [Paper presentation]. Séminaire de mathématiques discrètes.
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
Leroy, J. (December 2018). Decidability of the isomorphism and the factorization between minimal substitution subshifts [Paper presentation]. Informal workshop on aperiodic order.
Leroy, J. (September 2018). Rigidity and Substitutive Dendric Words [Paper presentation]. Journées Montoises d'Informatique Théorique 2018.
Leroy, J. (April 2017). Asymptotic behavior of regular sequences [Paper presentation]. Bridges between Automatic Sequences, Algebra and Number Theory.
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
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
Leroy, J. (June 2016). Factorization of minimal substitutive subshifts [Paper presentation]. Transversal aspects of tilings.
Leroy, J. (June 2016). Groupe de dimension de système dynamique, partie 1 [Paper presentation]. Groupe de travail à l'IRIF.
Leroy, J. (June 2016). Groupe de dimension de système dynamique, partie 2 [Paper presentation]. Groupe de travail au LIGM.
Leroy, J. (March 2016). Return words and factor complexity [Paper presentation]. Challenges in combinatorics on words.
Leroy, J. (22 January 2016). Mots de retour, récurrence et représentations S-adiques [Paper presentation]. Workshop sur les semi-groupes profinis, Marne-la-Vallée, France.
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
Leroy, J. (September 2015). A logarithmic commensurability theorem for a class of GDIFSs [Poster presentation]. Fractals and related fields III.
Leroy, J. (May 2015). Cobham's theorem for fractals in R^n [Paper presentation]. Workshop on automatic sequences.
Leroy, J. (January 2015). Return words and S-adicity of tree sets [Paper presentation]. Discrete mathematics day, Liège, Belgium.
Leroy, J. (December 2014). Topological factors between substitutive subshifts [Paper presentation]. Séminaire de mathématiques discrètes, Liège, Belgium.
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. (July 2014). Return words in tree sets [Paper presentation]. Séminaire de probabilité et théorie ergodique, Amiens, France.
Leroy, J. (June 2014). Maximal bifix decoding [Paper presentation]. Séminaire de mathématiques discrètes, Liège, Belgium.
Leroy, J. (April 2014). Caractérisation S-adique des sous-shifts minimaux de complexité inférieur à 2n+1 [Paper presentation]. Séminaire de mathématiques discrètes, Chambérry, France.
Leroy, J. (January 2014). Different frameworks for Cobham's theorem in R [Paper presentation]. Representing streams II, Leiden, Netherlands.
Leroy, J. (2014). Return words in tree sets [Paper presentation]. Mons Theoretical Computer Science Days.
Leroy, J. (January 2014). Sequences with complexiy 2n+1 [Paper presentation]. Séminaire d'algorithmique, Marne-la-Vallée, France.
Leroy, J. (December 2013). Cobham's theorem for graph directed iterated function systems [Paper presentation]. Séminaire de mathématiques discrètes, Liège, Belgium.
Leroy, J. (November 2013). A bridge between graph directed iterated function systems and Büchi automata [Paper presentation]. Workshop on Dynamics, Numeration and Tillings, Florianopolis, Brazil.
Leroy, J. (October 2013). Return words as basis of free groups [Paper presentation]. Séminaire d'équipe de Jean-Luc Marichal, Luxembourg, Luxembourg.
Leroy, J. (September 2013). Factor complexity of S-adic sequences [Paper presentation]. Séminaire de l'équipe DYSCO, Louvain-la-Neuve, Belgium.
Leroy, J. (June 2013). Factor complexity of S-adic sequences [Paper presentation]. Workshop on Dynamical systems, Automata and Algorithm of the GdR-IM, Amiens, France.
Leroy, J. (October 2012). An attempt to represent functions using Büchi automata [Paper presentation]. Séminaire de l'équipe de Jean-Luc Marichal, Luxembourg, Luxembourg.
Leroy, J. (July 2012). S-adic representations using Rauzy graphs [Paper presentation]. Workshop on Decidability problems for substitutive sequences, tilings and numerations of the ANR SubTiles, Amiens, France.
Leroy, J. (June 2012). Overview of the S-adic conjecture [Paper presentation]. Séminaire de l'équipe de topologie et dynamique de Paris Sud, Paris, France.
Leroy, J. (February 2012). Overview of the S-adic conjecture [Paper presentation]. Outstanding challenges in combinatorics on words, Banff, Canada.
Leroy, J. (January 2012). Overview of the S-adic conjecture [Paper presentation]. Premier Congrès Franco-Chilien en Dynamique et Combinatoire, Cap Hornu, France.
Leroy, J. (2011). Examples and counter-examples about the S-adic conjecture. In Local proceedings of Numeration 2011.
Peer reviewed
Leroy, J. (June 2011). Exemples et contre-exemples sur la conjecture S-adique [Paper presentation]. Séminaire de l'équipe ARITH, Montpellier, France.
Leroy, J. (June 2011). Overview of the S-adic conjecture [Paper presentation]. First european meeting of Ph. D. Students in mathematics, Amiens, France.
Leroy, J. (March 2011). Conjecture S-adique [Paper presentation]. Journée des doctorants d'Amiens, Amiens, France.
Leroy, J. (March 2011). Some improvements of the S-adic conjecture [Paper presentation]. Ecole jeunes chercheurs en Informatique Théorique, Amiens, France.
Leroy, J. (2011). Examples and counter-examples about the S-adic conjecture [Paper presentation]. Numeration 2011.
Leroy, J. (December 2010). The S-adic conjecture: general case and complexity 2n [Paper presentation]. School on Information and Randomness, Pucon, Chile.
Leroy, J. (October 2010). Conjecture S-adique [Paper presentation]. Séminaire Pythéas Fogg, Marseille, France.
Leroy, J. (2010). Some improvements of the S-adic conjecture (extended abstract). In Local proceedings of Mons Theoretical Computer Science Days.
Peer reviewed
Leroy, J. (May 2010). Initiation à Sage [Paper presentation]. Séminaire de probabilité et théorie ergodique, Amiens, France.
Leroy, J. (2010). Some improvements of the S-adic conjecture (extended abstract) [Paper presentation]. Mons Theoretical Computer Science Days.
Leroy, J. (September 2009). Autour de la conjecture S-adique [Paper presentation]. Séminaire de probabilité et théorie ergodique, Amiens, France.
Leroy, J. (October 2008). Systèmes de numération en base rationnelle [Paper presentation]. Séminaire des doctorants, Amiens, France.