scientific article; zbMATH DE number 1336330

zbMATH Open0922.68092MaRDI QIDQ4258669FDOQ4258669

Authors: Zoltán Kása 

Publication date: 14 September 1999

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4085051
• scientific article; zbMATH DE number 1091206
• Two-pattern strings. II: Frequency of occurrence and substring complexity
• Super-\(d\)-complexity of finite words
• A linearly computable measure of string complexity

zbMATH Keywords

stringssubstrings\(d\)-complexity of strings

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (20)

• Versatile string kernels
• On the Varshamov-Tenengolts construction on binary strings
• On Hardness of Several String Indexing Problems
• Title not available (Why is that?)
• On the Polynomial Depth of Various Sets of Random Strings
• A linearly computable measure of string complexity
• Title not available (Why is that?)
• Sublinear algorithms for approximating string compressibility
• Algorithms for subsequence combinatorics
• On average sequence complexity
• Non-standard stringology: algorithms and complexity
• On Simon's congruence closure of a string
• Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
• Two-pattern strings. II: Frequency of occurrence and substring complexity
• Total palindrome complexity of finite words
• The string guessing problem as a method to prove lower bounds on the advice complexity
• Topology of strings: median string is NP-complete
• On the complexity of learning strings and sequences
• The invariant problem for binary string structures and the parallel complexity theory of queries
• Title not available (Why is that?)

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 Q4258669)