References of "Leroy, Julien"
     in
Bookmark and Share    
See detailFactorisation de sous-shifts substitutifs minimaux
Leroy, Julien ULiege

Scientific conference (2021, January 15)

Detailed reference viewed: 50 (6 ULiège)
Full Text
Peer Reviewed
See detailOn The Dimension Group of Unimodular S-Adic Subshifts
Berthé, Valérie; Bernales, Paulina Cecchi; Durand, Fabien et al

in Monatshefte für Mathematik (2020)

Detailed reference viewed: 36 (7 ULiège)
See detailMinimal dendric subshifts
Leroy, Julien ULiege

Conference (2020, September)

Detailed reference viewed: 24 (0 ULiège)
See detailNombres irrationnels: représentations périodiques et géométriques
Leroy, Julien ULiege

Conference (2020, September)

Detailed reference viewed: 38 (6 ULiège)
See detailFactor complexity of minimal S-adic subshifts
Leroy, Julien ULiege

Conference (2020, July)

Detailed reference viewed: 28 (3 ULiège)
See detailSous-shifts dendriques et automorphismes du groupe libre
Leroy, Julien ULiege

Scientific conference (2020, March 20)

Detailed reference viewed: 15 (1 ULiège)
Full Text
Peer Reviewed
See detailComputing the k-binomial complexity of the Thue–Morse word
Lejeune, Marie ULiege; Leroy, Julien ULiege; Rigo, Michel ULiege

in Journal of Combinatorial Theory. Series A (2020), 176

Two words are k-binomially equivalent whenever they share the same subwords, i.e., subsequences, of length at most k with the same multiplicities. This is a refinement of both the abelian equivalence and ... [more ▼]

Two words are k-binomially equivalent whenever they share the same subwords, i.e., subsequences, of length at most k with the same multiplicities. This is a refinement of both the abelian equivalence and the Simon congruence. The k-binomial complexity of an infinite word x maps the integer n to the number of classes in the quotient, by this k-binomial equivalence relation, of the set of factors of length n occurring in x. This complexity measure has not been investigation very much. In this paper, we characterize the k-binomial complexity of the Thue–Morse word. The result is striking, compared to more familiar complexity functions. Although the Thue–Morse word is aperiodic, its k-binomial complexity eventually takes only two values. In this paper, we first express the number of occurrences of subwords appearing in iterates of the form Ψ^l(w) for an arbitrary morphism Ψ. We also thoroughly describe the factors of the Thue–Morse word by introducing a relevant new equivalence relation. [less ▲]

Detailed reference viewed: 67 (17 ULiège)
See detailGraphes de Rauzy et complexité linéaire
Leroy, Julien ULiege

Conference (2019, December)

Detailed reference viewed: 31 (0 ULiège)
See detailOn the dimension group of unimodular S-adic subshifts
Berthé, Valérie; Cecchi Bernales, Paulina; Durand, Fabien et al

E-print/Working paper (2019)

Detailed reference viewed: 31 (1 ULiège)
See detailUn théorème de Cobham pour les attracteurs d’IFS
Leroy, Julien ULiege

Conference (2019, October)

Detailed reference viewed: 16 (0 ULiège)
See detailDecidability of the isomorphism and the factorization between minimal substitution subshifts
Leroy, Julien ULiege

Scientific conference (2019, January 10)

Detailed reference viewed: 25 (2 ULiège)
Full Text
Peer Reviewed
See detailComputing the k-binomial complextiy of the Thue-Morse word
Lejeune, Marie ULiege; Leroy, Julien ULiege; Rigo, Michel ULiege

in Lecture Notes in Computer Science (2019), 11647

Two finite words are k-binomially equivalent whenever they share the same subwords, i.e., subsequences, of length at most k with the same multiplicities. This is a refinement of both abelian equivalence ... [more ▼]

Two finite words are k-binomially equivalent whenever they share the same subwords, i.e., subsequences, of length at most k with the same multiplicities. This is a refinement of both abelian equivalence and the Simon congruence. The k-binomial complexity of an infinite word 𝐱 maps the integer n to the number of classes in the quotient, by this k-binomial equivalence relation, of the set of factors of length n occurring in 𝐱. This complexity measure has not been investigated very much. In this paper, we characterize the k-binomial complexity of the Thue–Morse word. The result is striking, compared to more familiar complexity functions. Although the Thue–Morse word is aperiodic, its k-binomial complexity eventually takes only two values. In this paper, we first express the number of occurrences of subwords appearing in iterates of the form 𝛹^ℓ(𝑤) for an arbitrary morphism 𝛹. We also thoroughly describe the factors of the Thue–Morse word by introducing a relevant new equivalence relation. [less ▲]

Detailed reference viewed: 42 (15 ULiège)
See detailInitiation à la programmation en Python
Leroy, Julien ULiege

Conference given outside the academic context (2018)

Detailed reference viewed: 96 (3 ULiège)
Peer Reviewed
See detailRigidity and Substitutive Dendric Words
Leroy, Julien ULiege

Conference (2018, September)

Detailed reference viewed: 22 (1 ULiège)
Full Text
Peer Reviewed
See detailRigidity and substitutive dendric words
Berthé, Valérie; Dolce, Francesco; Durand, Fabien et al

in International Journal of Foundations of Computer Science (2018), 29(5), 705-720

Detailed reference viewed: 61 (8 ULiège)
Full Text
Peer Reviewed
See detailCounting Subwords Occurrences in Base-b Expansions
Leroy, Julien ULiege; Rigo, Michel ULiege; Stipulanti, Manon ULiege

in Integers (2018), 18A

We consider the sequence (Sb(n))n≥0 counting the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. By using a convenient tree structure, we provide ... [more ▼]

We consider the sequence (Sb(n))n≥0 counting the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. By using a convenient tree structure, we provide recurrence relations for (Sb(n))n≥0 leading to the b-regularity of the latter sequence. Then we deduce the asymptotics of the summatory function of the sequence (Sb(n))n≥0. [less ▲]

Detailed reference viewed: 90 (26 ULiège)
See detailDecidability of the isomorphism and the factorization between minimal substitution subshifts
Durand, F.; Leroy, Julien ULiege

E-print/Working paper (2018)

Detailed reference viewed: 43 (3 ULiège)