scientific article; zbMATH DE number 1992419
From MaRDI portal
Publication:4432080
Recommendations
Cited in
(19)- The complexity of computing maximal word functions
- On minimal words with given subword complexity
- Strings with maximally many distinct subsequences and substrings
- Maximal state complexity and generalized de Bruijn words
- Algorithms for subsequence combinatorics
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
- Cyclic Complexity of Words
- On maximal pattern complexity of some automatic words
- Super-d-complexity of finite words
- scientific article; zbMATH DE number 3849232 (Why is no real title available?)
- On correlation polynomials and subword complexity
- scientific article; zbMATH DE number 4085051 (Why is no real title available?)
- scientific article; zbMATH DE number 1091206 (Why is no real title available?)
- scientific article; zbMATH DE number 1992418 (Why is no real title available?)
- An improvement of subword complexity
- Abelian maximal pattern complexity of words
- Properties of the complexity function for finite words
- Proof of a conjecture on word complexity
- Behavior of various complexity functions
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)
