Dynamics of Sofic Shifts

Dynamics of Sofic Shifts

Descargar PDF Descargar PDF

Publicado en 3C Tecnología – Volume 11 Issue 2 (Ed. 42)




In this paper, we provide a characterization for the subshifts of finite type (SFT) in terms of Cellular automata (CA). In addition, we prove that 1. The following are equivalent for a non-singleton subshift of finite type XF. a) XF is transitive and Per(XF), the set of periodic points of XF, is cofinite b) XF is weak mixing c) XF is mixing. 2. For non-singleton sofic shifts, only the statements (a) and (b) are equivalent.


Palabras clave


subshift of finite type, sofic shifts, mixing, strongly connected digraph, labeled digraph, cellular automata

Articulos relacionados