On factorially balanced sets of words
From MaRDI portal
Publication:719290
DOI10.1016/j.tcs.2011.06.027zbMath1225.68142OpenAlexW2067842788MaRDI QIDQ719290
Patrice Séébold, Gwenaël Richomme
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00507782/file/Ens_equ_mots_sturm_Vrapport.pdf
Related Items (3)
Characterizations of families of morphisms and words via binomial complexities ⋮ Bifix codes and Sturmian words ⋮ Studies on finite Sturmian words
Cites Work
- Unnamed Item
- Unnamed Item
- Substitutions in dynamics, arithmetics and combinatorics
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- Complexity and special factors
- Sturmian morphisms and Rauzy's rules
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Balanced words
- Combinatorics on Words
- Représentation géométrique de suites de complexité $2n+1$
- Automatic Sequences
This page was built for publication: On factorially balanced sets of words
