The following pages link to Compression and entropy (Q5096807):
Displaying 6 items.
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
- Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields (Q2190980) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- Information rate of some classes of non-regular languages: an automata-theoretic approach (Q2407088) (← links)
- Fractal dimensions of \(k\)-automatic sets (Q6642880) (← links)
