On factorially balanced sets of words
From MaRDI portal
Recommendations
- Balances of m-bonacci Words
- Characterisations of balanced words via orderings
- Asymptotic formula for balanced words
- On the combinatorics of finite words
- \(m\)-balanced words: A generalization of balanced words
- Uniformly balanced words with linear complexity and prescribed letter frequencies
- scientific article; zbMATH DE number 1577991
- Optimizing properties of balanced words
- scientific article; zbMATH DE number 2150290
- scientific article; zbMATH DE number 2196238
Cites work
- Automatic Sequences
- Balanced words
- Combinatorics on Words
- Complexity and special factors
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1408353 (Why is no real title available?)
- Représentation géométrique de suites de complexité 2n+1
- Some combinatorial properties of Sturmian words
- Sturmian morphisms and Rauzy's rules
- Sturmian words: structure, combinatorics, and their arithmetics
- Substitutions in dynamics, arithmetics and combinatorics
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
Cited in
(8)- Bifix codes and Sturmian words
- Studies on finite Sturmian words
- Which Arnoux-Rauzy Words Are 2-Balanced?
- Balances of m-bonacci Words
- Enumeration formulæ in neutral sets
- On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
- scientific article; zbMATH DE number 2196238 (Why is no real title available?)
- Characterizations of families of morphisms and words via binomial complexities
This page was built for publication: On factorially balanced sets of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719290)
