Julien Leroy

According to our database1, Julien Leroy authored at least 23 papers between 2012 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2020
Computing the <i>k</i>-binomial complexity of the Thue-Morse word.
J. Comb. Theory, Ser. A, 2020

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

Computing the k-binomial Complexity of the Thue-Morse Word.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018
Counting Subword Occurrences in Base-b Expansions.
Integers, 2018

Rigidity and Substitutive Dendric Words.
Int. J. Found. Comput. Sci., 2018

Decidability of the isomorphism and the factorization between minimal substitution subshifts.
CoRR, 2018

2017
Specular sets.
Theor. Comput. Sci., 2017

The Constant of Recognizability is Computable for Primitive Morphisms.
J. Integer Seq., 2017

Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique".
RAIRO Theor. Informatics Appl., 2017

Counting the number of non-zero coefficients in rows of generalized Pascal triangles.
Discret. Math., 2017

Counting Subwords Occurrences in Base-b Expansions.
CoRR, 2017

Behavior of Digital Sequences Through Exotic Numeration Systems.
Electron. J. Comb., 2017

A Set of Sequences of Complexity 2n+1 2 n + 1.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Generalized Pascal triangle for binomial coefficients of words.
Adv. Appl. Math., 2016

Bispecial Factors in the Brun S-Adic System.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Maximal bifix decoding.
Discret. Math., 2015

Asymptotic properties of free monoid morphisms.
CoRR, 2015

2014
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2.
Discret. Math. Theor. Comput. Sci., 2014

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

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

2012
Towards a statement of the S-adic conjecture through examples
CoRR, 2012

Some improvements of the <i>S</i>-adic conjecture.
Adv. Appl. Math., 2012


  Loading...