Williams’s conjecture is false for reducible subshifts

Journal of the American Mathematical Society

Volumn 5, Issue 1, 1992, Pages 213-215

  Kim, K H ^a   Roush, F W ^a  

^a ALABAMA STATE UNIVERSITY   (United States)

Author keywords

Reducible shift; Shift equivalence; Strong shift equivalence; Subshift of finite type

Indexed keywords

EID: 84968502752     PISSN: 08940347     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0894-0347-1992-1130528-4     Document Type: Article

References (8)

1. R. Adler, D. Coppersmith, and M. Hassner, Algorithm for sliding block codes, IEEE Trans. Inform. Theory 29 (1983), 5–22.
2. K. Baker, Strong shift equivalence of 2 × 2 matrices of nonnegative integers, Ergodic Theory Dynamical Systems 3 (1983), 541–558.
3. R. Bowen, Markov partitions for Axiom A diffeomorphisms, Amer. J. Math. 92 (1970), 725–747.
4. K. H. Kim and F. W. Roush, Some results on decidability of shift equivalence, J. Combin. Inform. System Sci. 4 (1979), 123–146.
5. K. H. Kim, F. W. Roush, and J. Wagoner, Automorphisms of the dimension group and gyration numbers, J Amer. Math. Soc. 5 (1992), 191–212 (this issue).
6. M. Nasu, Topological conjugacy for sofic systems and extensions of automorphisms of subshifts of finite type, Dynamical Systems (J. C. Alexander, ed.), Lecture Notes in Math., vol. 1342, Springer-Verlag, Heidelberg, 1988.
7. R. F. Williams, Classification of subshifts of finite type, Ann. Math. 98 (1973), 120–153;
8. R. F. Williams Errata, Ann. Math. 99 (1974), 380–381.