论文信息 - Shannon graphs, subshifts and lambda-graph systems

Shannon graphs, subshifts and lambda-graph systems

The relationship between presentations of subshifts by Shannon graphs and by l-graph systems is studied. A class of presentations of subshifts by l-graph systems is characterized. A notion of synchronization is introduced. A class of presentations by l-graph systems, that are specifically associated to subshifts that fall under this notion, is characterized.

Kengo Matsumoto | Wolfgang Krieger

[1] Georges Hansel,et al. Systèmes Codés , 1986, Theor. Comput. Sci..

[2] Masakazu Nasu,et al. Topological conjugacy for sofic systems , 1986, Ergodic Theory and Dynamical Systems.

[3] O. Bratteli. Inductive limits of finite dimensional C*-algebras , 1972 .

[4] On strong shift equivalence of symbolic matrix systems , 2003, Ergodic Theory and Dynamical Systems.

[5] Roland Fischer. Sofic systems and graphs , 1975 .

[6] Wolfgang Krieger. On sofic systems II , 1984 .

[7] Masakazu Nasu,et al. Textile systems for endomorphisms and automorphisms of the shift , 1995 .

[8] Wolfgang Krieger. On Subshifts and Topological Markov Chains , 2000 .

[9] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .

[10] B. Weiss. Subshifts of finite type and sofic systems , 1973 .

[11] Michael E. Paul,et al. Sofic systems , 1975 .

[12] Mike Boyle,et al. Almost Markov and shift equivalent sofic systems , 1988 .