On factorially balanced sets of words
type: Item
instance of: scholarly article
title: On factorially balanced sets of words
zbMATH Open document ID: 1225.68142
author: Patrice Séébold
author: Gwénaël Richomme
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
full work available at URL: Ens equ mots sturm Vrapport.pdf
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5955904
zbMATH Keywords: balanced words
zbMATH Keywords: Sturmian words
MaRDI profile type: Publication
OpenAlex ID: W2067842788
cites work: Automatic Sequences
cites work: Représentation géométrique de suites de complexité $2n+1$
cites work: Q4941168
cites work: Combinatorics on Words
cites work: Complexity and special factors
cites work: Sturmian words: structure, combinatorics, and their arithmetics
cites work: Some combinatorial properties of Sturmian words
cites work: Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
cites work: Q4529547
cites work: Sturmian morphisms and Rauzy's rules
cites work: Substitutions in dynamics, arithmetics and combinatorics
cites work: Balanced words
DOI: 10.1016/J.TCS.2011.06.027
Recommended article: Balances of m-bonacci Words
Recommended article: Characterisations of balanced words via orderings
Recommended article: Asymptotic formula for balanced words
Recommended article: On the combinatorics of finite words
Recommended article: \(m\)-balanced words: A generalization of balanced words
Recommended article: Uniformly balanced words with linear complexity and prescribed letter frequencies
Recommended article: Q2704225
Recommended article: Optimizing properties of balanced words
Recommended article: Q4662839
Recommended article: Q5465070
description: scientific article; zbMATH DE number 5955904