Julien Leroy

According to our database, Julien Leroy authored at least 24 papers between 2012 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

S-adic characterization of minimal dendric shifts.

France Gheeraert, Julien Leroy

CoRR, 2022

2021

$\mathcal{S}$-adic characterization of minimal ternary dendric subshifts.

France Gheeraert, Marie Lejeune, Julien Leroy

CoRR, 2021

2020

Computing the <i>k</i>-binomial complexity of the Thue-Morse word.

Marie Lejeune, Julien Leroy, Michel Rigo

J. Comb. Theory, Ser. A, 2020

2019

Preface.

Émilie Charlier, Julien Leroy, Michel Rigo

Int. J. Found. Comput. Sci., 2019

Computing the k-binomial Complexity of the Thue-Morse Word.

Marie Lejeune, Julien Leroy, Michel Rigo

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

Counting Subword Occurrences in Base-b Expansions.

Julien Leroy, Michel Rigo, Manon Stipulanti

Integers, 2018

Rigidity and Substitutive Dendric Words.

Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy, Dominique Perrin

Int. J. Found. Comput. Sci., 2018

Decidability of the isomorphism and the factorization between minimal substitution subshifts.

Fabien Durand, Julien Leroy

CoRR, 2018

2017

Specular sets.

Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

Theor. Comput. Sci., 2017

The Constant of Recognizability is Computable for Primitive Morphisms.

Fabien Durand, Julien Leroy

J. Integer Seq., 2017

Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique".

Émilie Charlier, Julien Leroy, Michel Rigo

RAIRO Theor. Informatics Appl., 2017

Counting the number of non-zero coefficients in rows of generalized Pascal triangles.

Julien Leroy, Michel Rigo, Manon Stipulanti

Discret. Math., 2017

Counting Subwords Occurrences in Base-b Expansions.

Julien Leroy, Michel Rigo, Manon Stipulanti

CoRR, 2017

Behavior of Digital Sequences Through Exotic Numeration Systems.

Julien Leroy, Michel Rigo, Manon Stipulanti

Electron. J. Comb., 2017

A Set of Sequences of Complexity 2n+1 2 n + 1.

Julien Cassaigne, Sébastien Labbé, Julien Leroy

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Generalized Pascal triangle for binomial coefficients of words.

Julien Leroy, Michel Rigo, Manon Stipulanti

Adv. Appl. Math., 2016

Bispecial Factors in the Brun S-Adic System.

Sébastien Labbé, Julien Leroy

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

Maximal bifix decoding.

Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

Discret. Math., 2015

Asymptotic properties of free monoid morphisms.

Emilie Charlier, Julien Leroy, Michel Rigo

CoRR, 2015

2014

An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2.

Julien Leroy

Discret. Math. Theor. Comput. Sci., 2014

2013

A Combinatorial Proof of S-adicity for Sequences with Linear Complexity.

Julien Leroy, Gwénaël Richomme

Integers, 2013

Towards an analogue of Cobham's theorem for beta-numerations.

Emilie Charlier, Julien Leroy, Michel Rigo

CoRR, 2013

2012

Towards a statement of the S-adic conjecture through examples

Fabien Durand, Julien Leroy, Gwénaël Richomme

CoRR, 2012

Some improvements of the <i>S</i>-adic conjecture.

Julien Leroy

Adv. Appl. Math., 2012