Properties of the complexity function for finite words

MaRDI QIDQ5201214zbMATH OpenFDO

Authors Julien Cassaigne, Mira-Cristiana Anisiu

Publication date 12 April 2006

zbMATH Keywords

de Brujin graphfinite wordssubword complexity function

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1992418
• scientific article; zbMATH DE number 1992419
• On the minimal complexity of infinite words
• Symbolic analysis of finite words: the complexity function
• scientific article; zbMATH DE number 1091206

Cited in

(12)

• The complexity of computing maximal word functions
• On minimal words with given subword complexity
• Symbolic analysis of finite words: the complexity function
• Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
• Comparative study of finite wordlength effects in shift and delta operator parameterizations
• scientific article; zbMATH DE number 1091206 (Why is no real title available?)
• scientific article; zbMATH DE number 1992418 (Why is no real title available?)
• scientific article; zbMATH DE number 1992419 (Why is no real title available?)
• Proof of a conjecture on word complexity
• A symmetry property of Christoffel words
• A symmetry property of Christoffel words
• Combinatorics on finite words and the length of a finite-dimensional associative algebra

This page was built for publication: Properties of the complexity function for finite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5201214)