scientific article; zbMATH DE number 1091206
From MaRDI portal
Publication:4366995
zbMATH Open0886.68090MaRDI QIDQ4366995FDOQ4366995
Authors: Zoltán Kása 
Publication date: 7 January 1998
Title of this publication is not available (Why is that?)
Recommendations
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Arithmetical complexity of symmetric D0L words.
- On complexity functions of infinite words associated with generalized Dyck languages
- The complexity of computing maximal word functions
- Title not available (Why is that?)
- On correlation polynomials and subword complexity
- Symbolic analysis of finite words: the complexity function
- Properties of the complexity function for finite words
- Some bounds on the complexity of words
- Computation of k-ary Lyndon words using generating functions and their differential equations
- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
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 Q4366995)
