Nimrod Megiddo
Journal of Symbolic Computation
A continuous [formula omitted] action on a subshift of finite type consists of a subshift of finite type with its shift transformation, together with a group, G, of homeomorphisms of the subshift and a group automorphism T, so that the commutation relation σ ° g = Tg ° ∑A is any positive entropy subshift of finite type, G is any finite group and T is any automorphism of G then there is a non-trivial [formula omitted] action on ∑A. We then classify all such actions up to ‘almost topological‘ conjugacy. © 1985, Cambridge University Press. All rights reserved.
Nimrod Megiddo
Journal of Symbolic Computation
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering