Finite-state guessing exponent of any individual sequence equals its finite-state compressibility and is achieved by modified LZ78 decoder with random bits.
Universal coding with minimum probability o f code word length overflow,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines
Finite-state guessing exponent of any individual sequence equals its finite-state compressibility and is achieved by modified LZ78 decoder with random bits.