56 citations · 118 across the 18 of their papers we have counts for
6 papers · 1 filter
Behavior of digital sequences through exotic numeration systems
Julien Leroy, Michel Rigo, Manon Stipulanti
Many digital functions studied in the literature, e.g., the summatory function of the base- sum-of-digits function, have a behavior showing some periodic fluctuation. Such funct…
The constant of recognizability is computable for primitive morphisms
Fabien Durand, Julien Leroy
Mossé proved that primitive morphisms are recognizable. In this paper we give a computable upper bound for the constant of recognizability of such a morphism. This bound can be exp…
Specular sets
Valérie Berthé, Clelia De Felice, Vincent Delecroix +5
We introduce the notion of specular sets which are subsets of groups called here specular and which form a natural generalization of free groups. These sets are an abstract general…
An -adic characterization of minimal subshifts with first difference of complexity
Julien Leroy
In [Ergodic Theory Dynam. System, 16 (1996) 663--682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is -adic with $\card S \leq…
The finite index basis property
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbo…
Towards a statement of the S-adic conjecture through examples
Fabien Durand, Julien Leroy, Gwénaël Richomme
The -adic conjecture claims that there exists a condition such that a sequence has a sub-linear complexity if and only if it is an -adic sequence satisfying Condition …