We study the subshift behavior of one dimensional cellular automata and we show how to associate to any subshift of finite type a cellular automaton which contains it. The relationships between some topological properties of subshifts and the behavior of the related languages are investigated. In particular we focus our attention to the notion of full transitivity. We characterize the language related to a full transitive subshift extending the notion of irreducibility.
Cattaneo, G., Dennunzio, A. (2005). Subshift Behavior of Cellular Automata. Topological Properties and Related Languages. In Machines, Computations, and Universality (pp.140-152). Springer [10.1007/b106980].
Subshift Behavior of Cellular Automata. Topological Properties and Related Languages
CATTANEO, GIANPIERO;DENNUNZIO, ALBERTO
2005
Abstract
We study the subshift behavior of one dimensional cellular automata and we show how to associate to any subshift of finite type a cellular automaton which contains it. The relationships between some topological properties of subshifts and the behavior of the related languages are investigated. In particular we focus our attention to the notion of full transitivity. We characterize the language related to a full transitive subshift extending the notion of irreducibility.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
