scientific article; zbMATH DE number 4085051
From MaRDI portal
Publication:3814828
Recommendations
Cited in
(26)- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
- Super-stationary set, subword problem and the complexity
- Total palindrome complexity of finite words
- Construction of infinite de Bruijn arrays
- On the combinatorics of finite words
- Complexity for finite factors of infinite sequences
- Arithmetical complexity of symmetric D0L words.
- Maximal state complexity and generalized de Bruijn words
- Algorithms for subsequence combinatorics
- Complexity results on restricted instances of a paint shop problem for words
- Initial non-repetitive complexity of infinite words
- Super-d-complexity of finite words
- On possible growths of arithmetical complexity
- On correlation polynomials and subword complexity
- scientific article; zbMATH DE number 3943055 (Why is no real title available?)
- Versatile string kernels
- scientific article; zbMATH DE number 1336330 (Why is no real title available?)
- scientific article; zbMATH DE number 1091206 (Why is no real title available?)
- A linearly computable measure of string complexity
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- An improvement of subword complexity
- scientific article; zbMATH DE number 3892611 (Why is no real title available?)
- Concordance and consensus
- Sequences of linear arithmetical complexity
- Proof of a conjecture on word complexity
- Complexity of cutting words on regular tilings
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 Q3814828)
