Properties of the complexity function for finite words

zbMATH Open1087.68077MaRDI QIDQ5201214FDOQ5201214

Julien Cassaigne, Mira-Cristiana Anisiu

Publication date: 12 April 2006

zbMATH Keywords

finite wordssubword complexity functionde Brujin graph

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (6)

• 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

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the minimal complexity of infinite words 👍 👎
• Symbolic analysis of finite words: the complexity function 👍 👎
• Title not available (Why is that?) 👍 👎

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)