Factor-balanced $S$-adic languages
L\'eo Poirier (ENS Lyon), Wolfgang Steiner (IRIF)

TL;DR
This paper explores the concept of factor-balanced languages, establishing connections with letter-balanced languages like Thue-Morse, and characterizes factor-balancedness in Thue-Morse-Sturmian languages.
Contribution
It provides a comprehensive analysis of factor-balanced languages, especially in the context of substitution sequences, and characterizes factor-balancedness for Thue-Morse-Sturmian languages.
Findings
Factor-balanced and letter-balanced notions coincide for proper substitution sequences.
Thue-Morse sequence is letter-balanced but not factor-balanced.
Complete characterization of factor-balancedness in Thue-Morse-Sturmian 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 example of Thue-Morse-Sturmian languages, we give a full characterisation of factor-balancedness.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Mathematical Dynamics and Fractals
