- 741 Downloads
In this chapter we introduce some further topics which are closely tied to subshifts of finite type. In the first section we look at sofic systems. The continuous symbolic image of a subshift of finite type need not be a subshift of finite type. It may have an unbounded memory. Sofic systems are the symbolic systems that arise as continuous images of subshifts of finite type. There are three equivalent characterizations of these systems. The characterizations are explained and then we investigate some of the basic dynamical properties of sofic systems. The second section contains a discussion of Markov measures. These are the measures which have a finite memory. We define the measures, compute their measure-theoretic entropy, characterize the measures using conditional entropy and then prove that for a fixed subshift of finite type there is a unique Markov measure whose entropy is greater than the entropy of any other measure on the subshift of finite type. The third section investigates symbolic systems that have a group structure. These are the Markov subgroups. We show that any symbolic system with a group structure is a subshift of finite type. Then we classify them up to topological conjugacy. The fourth section contains a very brief introduction to cellular automata. The point is to see how they fit into the framework we have developed. The final section discusses channel codes as illustrated in Example 1.2.8. We describe a class of codes and develope an algorithm to construct them.
KeywordsCellular Automaton Finite Type Topological Entropy Maximal Measure Borel Probability Measure
Unable to display preview. Download preview PDF.
- [DGS]M. Denker, C. Grillenberger and K. Sigmund, Ergodic Theory on Compact Spaces Lecture Notes in Mathematics, 527, Springer-Verlag, (1976)Google Scholar
- FTW]D. Farmer, T. Toffoli and S. Wolfram, editors, Cellular Automata, North-Holland, 1984.Google Scholar
- Fe]W. Feller, An Introduction to Probability Theory and Its Applications, 3rd. edition, Wiley, 1968.Google Scholar
- [Fi2]R. Fischer, Graphs and Symbolic Dynamics, Proceedings of the Colloquia Mathematical Society János Bolyai, Information Theory 16 (1975) 229–244.Google Scholar
- [Gu]H. Gutowitz, editor, Cellular Automata: Theory and Experiment, MIT Press, 1991.Google Scholar
- [HU]J.E Hopcroft and J.D. Ullman, Frmal Languages and Their Relation to Automata, Addison-Wesley Publishing Co., 1969.Google Scholar
- [Kh]A. Khinchin, Mathematical Foundations of Statistical Mechanics, Dover Publications, 1949.Google Scholar
- [Pe]K. Petersen, Ergodic Theory, Cambridge Press, 1983.Google Scholar
- [Sd]K. Schmidt, Dynamical Systems of Algebraic Origin, Birkhäuser, 1995.Google Scholar
- [S]C. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal (1948), 379–473 and 623-656, reprinted in The Mathematical Theory of Communication by C. Shannon and W. Weaver, University of Illinois Press, 1963.Google Scholar
- [vN]J. von Neumann, Theory of Self-reproducing Automata (A.W. Burks, eds.), Univerity of Illinois Press, 1966.Google Scholar
- [Wa]P. Walters, An Introduction to Ergodic Theory GTM, Springer-Verlag, 1981.Google Scholar