Key points are not available for this paper at this time.
An irreducible parameterization for a finite memory source is constructed in the form of a tree machine. A universal information source for the set of finite memory sources is constructed by a predictive modification of an earlier studied algorithm-Context. It is shown that this universal source incorporates any minimal data-generating tree machine in an asymptotically optimal manner in the following sense: the negative logarithm of the probability it assigns to any long typical sequence, generated by any tree machine, approaches that assigned by the tree machine at the best possible rate.>
Building similarity graph...
Analyzing shared references across papers
Loading...
M.J. Weinberger
Stanford University
J. Rissanen
Linköping University
Meir Feder
Tel Aviv University
IEEE Transactions on Information Theory
Tel Aviv University
IBM (United States)
IBM Research - Almaden
Building similarity graph...
Analyzing shared references across papers
Loading...
Weinberger et al. (Mon,) studied this question.
synapsesocial.com/papers/6a11c2f3276e1b6925c909b6 — DOI: https://doi.org/10.1109/18.382011