WORD COMPLEXITY AND REPETITIONS IN WORDS
From MaRDI portal
Publication:5696964
DOI10.1142/S0129054104002297zbMATH Open1104.68089MaRDI QIDQ5696964FDOQ5696964
Authors: Lucian Ilie, Kaizhong Zhang, Sheng Yu 
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Compression of individual sequences via variable-rate coding
- The definition of random sequences
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- Title not available (Why is that?)
- Squares, cubes, and time-space efficient string searching
- An O(n log n) algorithm for finding all repetitions in a string
- Information-Theoretic Limitations of Formal Systems
- Sequences with minimal block growth
- Detecting leftmost maximal periodicities
- Sur un théorème de Thue
- Unending chess, symbolic dynamics and a problem in semi-groups
Cited In (10)
- On the distribution function of the complexity of finite sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-repetitive words: Ages and essences
- Words and repeated factors
- Prefix-suffix square reduction
- Fast algorithms for finding a minimum repetition representation of strings and trees
- The Lempel-Ziv Complexity of Fixed Points of Morphisms
- The Lempel–Ziv Complexity of Fixed Points of Morphisms
- Lie complexity of words
This page was built for publication: WORD COMPLEXITY AND REPETITIONS IN WORDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696964)
