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
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Imran Nasim, Michael E. Henderson
Mathematics
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000