## Abstract

The problem of predicting the next outcome of an individual binary sequence using finite memory, is considered. The finite-state predictability of an infinite sequence is defined as the minimum fraction of prediction errors that can be made by any finite-state (FS) predictor. It is proved that this FS predictability can be attained by universal sequential prediction schemes. Specifically, an efficient prediction procedure based on the incremental parsing procedure of the Lempel-Ziv data compression algorithm is shown to achieve asymptotically the FS predictability. Finally, some relations between compressibility and predictability are pointed out, and the predictability is proposed as an additional measure of the complexity of a sequence. nite-state machines, Lempel-Ziv algorithm.

Original language | English |
---|---|

Pages (from-to) | 1258-1270 |

Number of pages | 13 |

Journal | IEEE Transactions on Information Theory |

Volume | 38 |

Issue number | 4 |

DOIs | |

State | Published - Jul 1992 |

## Keywords

- Predictability
- complexity
- compressibility
- fi-