On Stable and Unstable Limit Sets of Finite Families of Cellular Automata

: Ville Salo, Ilkka Törmä

: Adrian-Horia Dediu, Carlos Martín-Vide

: Berlin

: 2012

: Lecture Notes in Computer Science

: Language and Automata Theory and Applications

: Lecture Notes in Computer Science

: 7183

: 502

: 513

: 978-3-642-28331-4

: 978-3-642-28332-1

: 0302-9743

DOI: https://doi.org/10.1007/978-3-642-28332-1_43

In this paper, we define the notion of limit set for a finite family of cellular automata, which is a generalization of the limit set of a single automaton. We prove that the hierarchy formed by increasing the number of automata in the defining set is infinite, and study the boolean closure properties of different classes of limit sets.