scientific article; zbMATH DE number 2089987

MaRDI QIDQ4808652zbMATH OpenFDO

Authors Lucian Ilie, Kaizhong Zhang, Sheng Yu

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2387/23870320.htm

zbMATH Keywords

algorithmswordsinfinite wordsde Bruijn wordssubword complexityLempel-Ziv complexityultimate periodicityiterated morphismsrepetition complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• WORD COMPLEXITY AND REPETITIONS IN WORDS
• The Lempel–Ziv Complexity of Fixed Points of Morphisms
• The Lempel-Ziv Complexity of Fixed Points of Morphisms
• Publication:4934345
• scientific article; zbMATH DE number 3892611

Cited in

(8)

• scientific article; zbMATH DE number 1855593 (Why is no real title available?)
• Words and repeated factors
• WORD COMPLEXITY AND REPETITIONS IN WORDS
• Prefix-suffix square reduction
• Sublinear algorithms for approximating string compressibility
• On average sequence complexity
• Lie complexity of words
• Joint string complexity for Markov sources: small data matters

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