Title:
Information Accessibility and Cryptic Processes: Linear Combinations of Causal States
Author(s):
John Mahoney, Christopher Ellison, James Crutchfield
Paper #:
09-06-019
Date:
June 1, 2009
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.
Facebook
Twitter
Email Newsletter
SFI News Feed
Google+
YouTube
iTunes U