 In the second of the two papers that introduced these algorithms they are analyzed as encoders defined by finite-state machines.A measure analogous to information entropy is developed for individual sequences (as opposed to probabilistic ensembles).This measure gives a bound on the data compression ratio that can be achieved.