scientific article; zbMATH DE number 1992419
From MaRDI portal
Publication:4432080
zbMATH Open1026.68104MaRDI QIDQ4432080FDOQ4432080
Authors: Zoltán Blázsik, Zoltán Kása, Mira-Cristiana Anisiu 
Publication date: 14 October 2003
Title of this publication is not available (Why is that?)
Recommendations
Cited In (17)
- Super-\(d\)-complexity of finite words
- Maximal state complexity and generalized de Bruijn words
- Title not available (Why is that?)
- Abelian maximal pattern complexity of words
- Behavior of various complexity functions
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
- Title not available (Why is that?)
- Proof of a conjecture on word complexity
- Cyclic Complexity of Words
- The complexity of computing maximal word functions
- Algorithms for subsequence combinatorics
- Title not available (Why is that?)
- 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)
