  This article gives a self-contained analysis of the performance of the
Lempel-Ziv compression algorithm on (hidden) Markovian sources. Specifically we
include a full proof of the assertion that the compression rate approaches the
entropy rate of the chain being compressed.
