Languages under substitutions and balanced words
From MaRDI portal
Publication:558187
DOI10.5802/JTNB.438zbMATH Open1085.11013OpenAlexW2016504724MaRDI QIDQ558187FDOQ558187
Authors: 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
Recommendations
Cites Work
- Uniqueness Theorems for Periodic Functions
- Complexity and special factors
- Some combinatorial properties of Sturmian words
- On the number of factors of Sturmian words
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
- Sturmian morphisms and Rauzy's rules
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- Intertwinings of periodic sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New string attractor-based complexities for infinite words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subword balance in binary words, languages and sequences
- Study of irreducible balanced pairs for substitutive languages
- Symmetrization of bounded remainder sets
- Moduli of toric tilings into bounded remainder sets and balanced words
- String attractors and infinite words
- Factor-balanced \(S\)-adic languages
This page was built for publication: Languages under substitutions and balanced words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558187)
