arXiv · 0906.5099
Information Accessibility and Cryptic Processes: Linear Combinations of Causal States
Abstract
We show in detail how to determine the time-reversed representation of a stationary hidden stochastic process from linear combinations of its forward-time $ε$-machine causal states. This also gives a check for the $k$-cryptic expansion recently introduced to explore the temporal range over which internal state information is spread.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
John R. Mahoney, Christopher J. Ellison, James P. Crutchfield. 2009-06-27. Information Accessibility and Cryptic Processes: Linear Combinations of Causal States. https://arxiv.org/abs/0906.5099
Cite the original work for its findings. Save a collection to share your selection of sources.