On stable and unstable limit sets of finite families of cellular automata

Authors:
Ville Salo;Ilkka Törmä
Affiliations:
University of Turku, Finland;University of Turku, Finland
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 3
Cited 0

Rice's theorem for the limit sets of cellular automata

Theoretical Computer Science
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Limit Sets of Stable and Unstable Cellular Automata

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.