scientific article; zbMATH DE number 5990082

MaRDI QIDQ3104403zbMATH OpenFDO

Authors Zoltán Kása

Publication date 19 December 2011

zbMATH Keywords

word complexityscattered subword\(d\)-complexitysuper-\(d\)-complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Scattered subword complexity of non-primitive words
• Asymptotic subword complexity
• On subword complexity functions
• On the character of words of sublinear complexity
• Subword complexity and projection bodies
• On the state complexity of scattered substrings and superstrings
• Subword complexity and finite characteristic numbers
• Subword complexity and Laurent series
• On Subword Complexity of Morphic Sequences
• On correlation polynomials and subword complexity

Cited in

(5)

• Versatile string kernels
• Super-\(d\)-complexity of finite words
• Methods for the graph realization problem
• Simon's theorem for scattered words
• Scattered subwords and composition of natural numbers

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