Factor-balanced S-adic languages - Institut de Recherche en Informatique Fondamentale Access content directly
Preprints, Working Papers, ... (Preprint) Year : 2023

Factor-balanced S-adic languages

Abstract

A set of words, also called a language, is letter-balanced if the number of occurrences of each letter only depends on the length of the word, up to a constant. Similarly, a language is factor-balanced if the difference of the number of occurrences of any given factor in words of the same length is bounded. The most prominent example of a letter-balanced but not factor-balanced language is given by the Thue-Morse sequence. We establish connections between the two notions, in particular for languages given by substitutions and, more generally, by sequences of substitutions. We show that the two notions essentially coincide when the sequence of substitutions is proper. For the class of Thue-Morse-Sturmian languages, we give a full characterisation of factor-balancedness.
Fichier principal
Vignette du fichier
factorbalance.pdf (165.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03869990 , version 1 (24-11-2022)
hal-03869990 , version 2 (23-11-2023)

Identifiers

Cite

Léo Poirier, Wolfgang Steiner. Factor-balanced S-adic languages. 2023. ⟨hal-03869990v2⟩
11 View
7 Download

Altmetric

Share

Gmail Facebook X LinkedIn More