Information Accessibility and Cryptic Processes:
Linear Combinations of Causal States

John R. Mahoney, Christopher J. Ellison, and James P. Crutchfield

Complexity Sciences Center and Physics Department
University of California at Davis
Davis, CA 95616

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.


J. R. Mahoney, C. J. Ellison, and J. P. Crutchfield, "Information Accessibility and Cryptic Processes" (2009) online.
[pdf] 141 kB
Santa Fe Institute Working Paper 09-06-019.
arXiv:0906.5099 [cond-mat].