The following pages link to Universal Tests for Memory Words (Q5346330):
Displaying 3 items.
- On universal algorithms for classifying and predicting stationary processes (Q2039763) (← links)
- A note on the Rényi criterion for Poisson processes and their identification (Q5870415) (← links)
- Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates (Q6634799) (← links)