ISBN-13: 9780821804773 / Angielski / Twarda / 1996 / 249 str.
This work, on finite-alphabet stationary processes - important in physics, engineering, and data compression - focuses on the combinatorial properties of typical finite sample paths drawn from a stationary, ergodic process. A primary goal, only partially realized, is to develop a theory based directly on sample path arguments with minimal appeals to the probability formalism. A secondary goal is to give a careful presentation of the many models for stationary finite-alphabet processes that have been developed in probability theory, ergodic theory, and information theory.