Information Accessibility and Cryptic Processes: Linear Combinations of Causal States
Statistical Mechanics
2009-06-30 v1
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 -cryptic expansion recently introduced to explore the temporal range over which internal state information is spread.
Cite
@article{arxiv.0906.5099,
title = {Information Accessibility and Cryptic Processes: Linear Combinations of Causal States},
author = {John R. Mahoney and Christopher J. Ellison and James P. Crutchfield},
journal= {arXiv preprint arXiv:0906.5099},
year = {2009}
}
Comments
6 pages, 9 figures, 2 tables; http://users.cse.ucdavis.edu/~cmg/compmech/pubs/iacplcocs.htm