56 citations · 118 across the 18 of their papers we have counts for
8 papers · 1 filter
A Set of Sequences of Complexity
Julien Cassaigne, Sébastien Labbé, Julien Leroy
We prove the existence of a ternary sequence of factor complexity for any given vector of rationally independent letter frequencies. Such sequences are constructed from an i…
Counting Subwords Occurrences in Base-b Expansions
Julien Leroy, Michel Rigo, Manon Stipulanti
We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence co…
Counting the number of non-zero coefficients in rows of generalized Pascal triangles
Julien Leroy, Michel Rigo, Manon Stipulanti
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 binomia…
Generalized Pascal triangle for binomial coefficients of words
Julien Leroy, Michel Rigo, Manon Stipulanti
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 ano…
Asymptotic properties of free monoid morphisms
Emilie Charlier, Julien Leroy, Michel Rigo
Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account.…
Bifix codes and interval exchanges
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We investigate the relation between bifix codes and interval exchange transformations. We prove that the class of natural codings of regular interval echange transformations is clo…
Maximal bifix decoding
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We introduce a class of sets of words which is a natural common generalization of Sturmian sets and of interval exchange sets. This class of sets consists of the uniformly recurren…
Acyclic, connected and tree sets
Valerie Berthé, Clelia De Felice, Francesco Dolce +4
Given a set of words, one associates to each word in an undirected graph, called its extension graph, and which describes the possible extensions of on the left and…