A universal data compression algorithm is described which is capable of compressing long strings generated by a "finitely generated" source, with a near optimum per symbol length without prior knowledge of the source. This class of sources may be viewed as a generalization of Markov sources to random fields. Moreover, the algorithm does not require a working storage much larger than that needed to describe the source generating parameters.
No takes yet. Share an insight, caveat, or question.
J. Rissanen (1983) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: