References of "Leroy, Julien"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSpecular sets
Berthé, Valérie; De Felice, Clelia; Delecroix, Vincent et al

in Theoretical Computer Science (2017), 684

Detailed reference viewed: 16 (2 ULg)
Full Text
Peer Reviewed
See detailBalanced sequences of complexity 2n+1
Cassaigne, Julien; Labbé, Sébastien; Leroy, Julien ULg

E-print/Working paper (2017)

Detailed reference viewed: 13 (1 ULg)
See detailAsymptotic behavior of regular sequences
Leroy, Julien ULg

Scientific conference (2017, April)

Detailed reference viewed: 7 (1 ULg)
Full Text
Peer Reviewed
See detailBehavior of digital sequences through exotic numeration systems
Leroy, Julien ULg; Rigo, Michel ULg; Stipulanti, Manon ULg

in Electronic Journal of Combinatorics (2017), 24(1), 14436

Many digital functions studied in the literature, e.g., the summatory function of the base-k sum-of-digits function, have a behavior showing some periodic fluctuation. Such functions are usually studied ... [more ▼]

Many digital functions studied in the literature, e.g., the summatory function of the base-k sum-of-digits function, have a behavior showing some periodic fluctuation. Such functions are usually studied using techniques from analytic number theory or linear algebra. In this paper we develop a method based on exotic numeration systems and we apply it on two examples motivated by the study of generalized Pascal triangles and binomial coefficients of words. [less ▲]

Detailed reference viewed: 58 (18 ULg)
Full Text
Peer Reviewed
See detailThe constant of recognizability is computable for primitive morphisms
Durand, Fabien; Leroy, Julien ULg

in Journal of Integer Sequences (2017), 20(4),

Detailed reference viewed: 13 (4 ULg)
See detailDevelopments in Language Theory
Charlier, Emilie ULg; Leroy, Julien ULg; Rigo, Michel ULg

Book published by Springer (2017)

The series of international conferences on Developments in Language Theory provides a forum for presenting current developments in formal languages and automata. Its scope is very general and includes ... [more ▼]

The series of international conferences on Developments in Language Theory provides a forum for presenting current developments in formal languages and automata. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphs, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular automata; bio-inspired computing; quantum computing. The papers submitted to DLT 2017 were from 19 countries including Belgium, Canada, Czech Republic, France, Germany, Hungary, India, Italy, Japan, The Netherlands, Poland, Portugal, Republic of Korea, Russia, Slovakia, South Africa, Thailand and USA. [less ▲]

Detailed reference viewed: 16 (2 ULg)
Full Text
Peer Reviewed
See detailRigidity and substitutive tree words
Berthé, Valérie; Dolce, Francesco; Durand, Fabien et al

E-print/Working paper (2017)

Detailed reference viewed: 15 (1 ULg)
Full Text
Peer Reviewed
See detailCounting the number of non-zero coefficients in rows of generalized Pascal triangles
Leroy, Julien ULg; Rigo, Michel ULg; Stipulanti, Manon ULg

in Discrete Mathematics (2017), 340

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words ... [more ▼]

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence (S(n))n≥0 counting the number of positive entries on each row. By introducing a convenient tree structure, we provide a recurrence relation for (S(n))n≥0. This leads to a connection with the 2-regular Stern–Brocot sequence and the sequence of denominators occurring in the Farey tree. Then we extend our construction to the Zeckendorf numeration system based on the Fibonacci sequence. Again our tree structure permits us to obtain recurrence relations for and the F-regularity of the corresponding sequence. [less ▲]

Detailed reference viewed: 77 (13 ULg)
Full Text
See detailDecidable properties of extension graphs for substitutive languages
Dolce, Francesco; Kyriakoglou, Revekka; Leroy, Julien ULg

E-print/Working paper (2017)

Detailed reference viewed: 13 (0 ULg)
Full Text
Peer Reviewed
See detailDecidable properties of extension graphs for substitutive languages
Dolce, Francesco; Kyriakoglou, Revekka; Leroy, Julien ULg

Conference (2016, September 07)

Detailed reference viewed: 20 (5 ULg)
Full Text
Peer Reviewed
See detailAsymptotic properties of free monoid morphisms
Charlier, Emilie ULg; Leroy, Julien ULg; Rigo, Michel ULg

in Linear Algebra & its Applications (2016), 500

Detailed reference viewed: 33 (15 ULg)
Peer Reviewed
See detailFactorization of minimal substitutive subshifts
Leroy, Julien ULg

Conference (2016, June)

Detailed reference viewed: 16 (6 ULg)
See detailGroupe de dimension de système dynamique, partie 2
Leroy, Julien ULg

Scientific conference (2016, June)

Detailed reference viewed: 17 (2 ULg)
See detailGroupe de dimension de système dynamique, partie 1
Leroy, Julien ULg

Scientific conference (2016, June)

Detailed reference viewed: 15 (2 ULg)
See detailReturn words and factor complexity
Leroy, Julien ULg

Conference (2016, March)

Detailed reference viewed: 16 (2 ULg)
See detailMots de retour, récurrence et représentations S-adiques
Leroy, Julien ULg

Conference (2016, January 22)

Detailed reference viewed: 11 (5 ULg)
Full Text
Peer Reviewed
See detailBispecial Factors in the Brun S-Adic System
Labbé, Sébastien ULg; Leroy, Julien ULg

in Brlek, Sre Vcko; Reutenauer, Christophe (Eds.) Developments in Language Theory: 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings (2016)

Detailed reference viewed: 34 (19 ULg)
Full Text
Peer Reviewed
See detailGeneralized Pascal triangle for binomial coefficients of words
Leroy, Julien ULg; Rigo, Michel ULg; Stipulanti, Manon ULg

in Advances in Applied Mathematics (2016), 80

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word ... [more ▼]

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpiński gasket that can be built as the limit set, for the Hausdorff distance, of a convergent sequence of normalized compact blocks extracted from Pascal triangle modulo 2, we describe and study the first properties of the subset of [0, 1] × [0, 1] associated with this extended Pascal triangle modulo a prime p. [less ▲]

Detailed reference viewed: 174 (82 ULg)
Full Text
See detailBispecial factors in the Brun S-adic system
Labbé, Sébastien ULg; Leroy, Julien ULg

E-print/Working paper (2016)

Detailed reference viewed: 40 (5 ULg)
Full Text
Peer Reviewed
See detailSpecular sets
Berthé, Valérie; Felice, Clelia; Delecroix, Vincent et al

in Manea, Florin; Nowotka, Dirk (Eds.) Combinatorics on Words: 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings (2015, September)

Detailed reference viewed: 15 (6 ULg)