Computer Science – Information Theory
Scientific paper
2011-11-14
Computer Science
Information Theory
13 pages, 3 figures; http://csc.ucdavis.edu/~cmg/compmech/pubs/ieepcsg.htm
Scientific paper
We present two examples of finite-alphabet, infinite excess entropy processes generated by invariant hidden Markov models (HMMs) with countable state sets. The first, simpler example is not ergodic, but the second is. It appears these are the first constructions of processes of this type. Previous examples of infinite excess entropy processes over finite alphabets admit only invariant HMM presentations with uncountable state sets.
Crutchfield James P.
Travers Nicholas F.
No associations
LandOfFree
Infinite Excess Entropy Processes with Countable-State Generators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Infinite Excess Entropy Processes with Countable-State Generators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite Excess Entropy Processes with Countable-State Generators will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-708042