Title :
On tree sources, finite state machines, and time reversal
Author :
Seroussi, Gadiel ; Weinberger, Marcelo
Author_Institution :
Hewlett-Packard Co., Palo Alto, CA, USA
Abstract :
We investigate the effect of time reversal on tree models of finite-memory processes. This is motivated in part by the following simple question that arises in some data compression applications: when trying to compress a data string using a universal source modeler, can it make a difference whether we read the string from left to right or from right to left? We characterize the class of finite-memory two-sided tree processes, whose time-reversed versions also admit tree models. Given a tree model, we present a construction of the tree model corresponding to the reverse process, and we show that the number of states in the reverse tree might be, in the extreme case, quadratic in the number of states of the original tree. This answers the above motivating question in the affirmative
Keywords :
Markov processes; finite state machines; source coding; trees (mathematics); data compression applications; finite state machines; finite-memory processes; reverse process; states number; time reversal; tree sources; two-sided tree processes; universal source modeler; Automata; Context modeling; Convergence; Costs; Data compression; Entropy; Laboratories; Markov processes; Tree graphs;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.550377