Properties of the complexity function for finite words

zbMATH Open1087.68077MaRDI QIDQ5201214FDOQ5201214

Authors: Julien Cassaigne, Mira-Cristiana Anisiu 

Publication date: 12 April 2006

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

zbMATH Keywords

finite wordssubword complexity functionde Brujin graph

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (7)

• Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
• Proof of a conjecture on word complexity
• The complexity of computing maximal word functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symbolic analysis of finite words: the complexity function
• Comparative study of finite wordlength effects in shift and delta operator parameterizations

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)