Complexity of Generic Limit Sets of Cellular Automata

DOI10.1007/978-3-030-61588-8_10MaRDI QIDQ6329802arXivFDO

Authors Ilkka A. Törmä

Publication date 25 November 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-61588-8_10

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

arXiv classification

math.DS

Abstract: The generic limit set of a topological dynamical system of 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

S i g m a_{3}^{0}

-hard, and lower in various special cases. We also prove a structural restriction on generic limit sets with a global period.

This page was built for publication: Complexity of Generic Limit Sets of Cellular Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6329802)