Julien Leroy

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 27

Top Topics

Text Recognition

Asymptotic Properties

Top Venues

Publications

France Gheeraert, Herman Goulet-Ouellet, Julien Leroy, Pierre Stas
Algebraic characterization of dendricity. CoRR (2024)
France Gheeraert, Julien Leroy
S-adic characterization of minimal dendric shifts. CoRR (2022)
France Gheeraert, Marie Lejeune, Julien Leroy
$\mathcal{S}$-adic characterization of minimal ternary dendric subshifts. CoRR (2021)
Marie Lejeune, Julien Leroy, Michel Rigo
-binomial complexity of the Thue-Morse word. J. Comb. Theory, Ser. A 176 (2020)
Émilie Charlier, Julien Leroy, Michel Rigo
Preface. Int. J. Found. Comput. Sci. 30 (1) (2019)
Marie Lejeune, Julien Leroy, Michel Rigo
Computing the k-binomial Complexity of the Thue-Morse Word. DLT (2019)
Marie Lejeune, Julien Leroy, Michel Rigo
Computing the k-binomial complexity of the Thue-Morse word. CoRR (2018)
Julien Leroy, Michel Rigo, Manon Stipulanti
Counting Subword Occurrences in Base-b Expansions. Integers (2018)
Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy, Dominique Perrin
Rigidity and Substitutive Dendric Words. Int. J. Found. Comput. Sci. 29 (5) (2018)
Fabien Durand, Julien Leroy
Decidability of the isomorphism and the factorization between minimal substitution subshifts. CoRR (2018)
Julien Cassaigne, Sébastien Labbé, Julien Leroy
A Set of Sequences of Complexity 2n+1 2 n + 1. WORDS (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. Discret. Math. 340 (5) (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Behavior of Digital Sequences Through Exotic Numeration Systems. Electron. J. Comb. 24 (1) (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Generalized Pascal triangle for binomial coefficients of words. CoRR (2017)
Émilie Charlier, Julien Leroy, Michel Rigo
Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique". RAIRO Theor. Informatics Appl. 51 (4) (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Counting Subwords Occurrences in Base-b Expansions. CoRR (2017)
Fabien Durand, Julien Leroy
The Constant of Recognizability is Computable for Primitive Morphisms. J. Integer Seq. 20 (4) (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Behavior of digital sequences through exotic numeration systems. CoRR (2017)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular sets. Theor. Comput. Sci. 684 (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. CoRR (2017)
Julien Leroy, Michel Rigo, Manon Stipulanti
Generalized Pascal triangle for binomial coefficients of words. Adv. Appl. Math. 80 (2016)
Sébastien Labbé, Julien Leroy
Bispecial Factors in the Brun S-Adic System. DLT (2016)
Fabien Durand, Julien Leroy
The constant of recognizability is computable for primitive morphisms. CoRR (2016)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Maximal bifix decoding. Discret. Math. 338 (5) (2015)
Emilie Charlier, Julien Leroy, Michel Rigo
Asymptotic properties of free monoid morphisms. CoRR (2015)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular Sets. WORDS (2015)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular sets. CoRR (2015)
Julien Leroy
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Julien Leroy
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2. CoRR (2013)
Julien Leroy, Gwénaël Richomme
A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers 13 (2013)
Emilie Charlier, Julien Leroy, Michel Rigo
Towards an analogue of Cobham's theorem for beta-numerations. CoRR (2013)
Fabien Durand, Julien Leroy, Gwénaël Richomme
Towards a statement of the S-adic conjecture through examples CoRR (2012)
Julien Leroy
-adic conjecture. Adv. Appl. Math. 48 (1) (2012)