scientific article; zbMATH DE number 1992419

MaRDI QIDQ4432080zbMATH OpenFDO

Authors Zoltán Blázsik, Zoltán Kása, Mira-Cristiana Anisiu

Publication date 14 October 2003

zbMATH Keywords

finite wordsmaximal complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Properties of the complexity function for finite words
• scientific article; zbMATH DE number 1992418
• On minimal words with given subword complexity
• On maximal pattern complexity of some automatic words
• scientific article; zbMATH DE number 1091206

Cited in

(17)

• Super-\(d\)-complexity of finite words
• Maximal state complexity and generalized de Bruijn words
• scientific article; zbMATH DE number 4085051 (Why is no real title available?)
• Behavior of various complexity functions
• Abelian maximal pattern complexity of words
• Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
• scientific article; zbMATH DE number 3849232 (Why is no real title available?)
• Proof of a conjecture on word complexity
• Cyclic Complexity of Words
• The complexity of computing maximal word functions
• Algorithms for subsequence combinatorics
• scientific article; zbMATH DE number 1992418 (Why is no real title available?)
• On correlation polynomials and subword complexity
• Strings with maximally many distinct subsequences and substrings
• An improvement of subword complexity
• Properties of the complexity function for finite words
• On maximal pattern complexity of some automatic words

This page was built for publication:

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