Languages under substitutions and balanced words

DOI10.5802/jtnb.438zbMath1085.11013OpenAlexW2016504724MaRDI QIDQ558187

Alex Heinis

Publication date: 30 June 2005

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_2004__16_1_151_0

zbMATH Keywords

substitutionssubword complexitybalanced word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (4)

Unnamed Item ⋮ String attractors and infinite words ⋮ Moduli of toric tilings into bounded remainder sets and balanced words ⋮ Symmetrization of bounded remainder sets

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of factors of Sturmian words
• Intertwinings of periodic sequences
• Complexity and special factors
• Sturmian morphisms and Rauzy's rules
• Some combinatorial properties of Sturmian words
• A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
• Uniqueness Theorems for Periodic Functions
• Sequences with minimal block growth
• Symbolic Dynamics II. Sturmian Trajectories

This page was built for publication: Languages under substitutions and balanced words