WORD COMPLEXITY AND REPETITIONS IN WORDS
From MaRDI portal
Publication:5696964
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- A universal algorithm for sequential data compression
- An O(n log n) algorithm for finding all repetitions in a string
- An optimal algorithm for computing the repetitions in a word
- Compression of individual sequences via variable-rate coding
- Detecting leftmost maximal periodicities
- Information-Theoretic Limitations of Formal Systems
- On the Complexity of Finite Sequences
- Optimal off-line detection of repetitions in a string
- Sequences with minimal block growth
- Squares, cubes, and time-space efficient string searching
- Sur un théorème de Thue
- The definition of random sequences
- Unending chess, symbolic dynamics and a problem in semi-groups
Cited in
(10)- On the distribution function of the complexity of finite sequences
- scientific article; zbMATH DE number 2089987 (Why is no real title available?)
- scientific article; zbMATH DE number 1855593 (Why is no real title available?)
- 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)
