Complexity of Generic Limit Sets of Cellular Automata - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2020

Complexity of Generic Limit Sets of Cellular Automata

Abstract

The generic limit set of a topological dynamical system is the smallest closed subset of the phase space that has a comeager realm of attraction. It intuitively captures the asymptotic dynamics of almost all initial conditions. It was defined by Milnor and studied in the context of cellular automata, whose generic limit sets are subshifts, by Djenaoui and Guillon. In this article we study the structural and computational restrictions that apply to generic limit sets of cellular automata. As our main result, we show that the language of a generic limit set can be at most $$\varSigma ^0_3$$-hard, and lower in various special cases. We also prove a structural restriction on generic limit sets with a global period.
Fichier principal
Vignette du fichier
496967_1_En_10_Chapter.pdf (439 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03659465 , version 1 (05-05-2022)

Licence

Attribution

Identifiers

Cite

Ilkka Törmä. Complexity of Generic Limit Sets of Cellular Automata. 26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Aug 2020, Stockholm, Sweden. pp.126-138, ⟨10.1007/978-3-030-61588-8_10⟩. ⟨hal-03659465⟩
34 View
6 Download

Altmetric

Share

Gmail Facebook X LinkedIn More