scientific article; zbMATH DE number 1091206
From MaRDI portal
Publication:4366995
Recommendations
Cited in
(14)- Computation of k-ary Lyndon words using generating functions and their differential equations
- The complexity of computing maximal word functions
- scientific article; zbMATH DE number 1992419 (Why is no real title available?)
- The complexity of tangent words
- scientific article; zbMATH DE number 3892611 (Why is no real title available?)
- On complexity functions of infinite words associated with generalized Dyck languages
- On correlation polynomials and subword complexity
- Properties of the complexity function for finite words
- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
- Some bounds on the complexity of words
- scientific article; zbMATH DE number 4085051 (Why is no real title available?)
- Symbolic analysis of finite words: the complexity function
- Arithmetical complexity of symmetric D0L words.
- Super-\(d\)-complexity of finite 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 Q4366995)
