On Decidability Properties of One-Dimensional Cellular Automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Cellular Automata Année : 2011

On Decidability Properties of One-Dimensional Cellular Automata

Résumé

In a recent paper Sutner proved that the first-order theory of the phase-space $\mathcal{S}_\mathcal{A}=(Q^\mathbb{Z}, \longrightarrow)$ of a one-dimensional cellular automaton $\mathcal{A}$ whose configurations are elements of $Q^\mathbb{Z}$, for a finite set of states $Q$, and where $\longrightarrow$ is the ``next configuration relation", is decidable. He asked whether this result could be extended to a more expressive logic. We prove in this paper that this is actuallly the case. We first show that, for each one-dimensional cellular automaton $\mathcal{A}$, the phase-space $\mathcal{S}_\mathcal{A}$ is an omega-automatic structure. Then, applying recent results of Kuske and Lohrey on omega-automatic structures, it follows that the first-order theory, extended with some counting and cardinality quantifiers, of the structure $\mathcal{S}_\mathcal{A}$, is decidable. We give some examples of new decidable properties for one-dimensional cellular automata. In the case of surjective cellular automata, some more efficient algorithms can be deduced from results of Kuske and Lohrey on structures of bounded degree. On the other hand we show that the case of cellular automata give new results on automatic graphs.
Fichier principal
Vignette du fichier
JCA_0061_FINKEL.pdf (159.03 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00371169 , version 1 (26-03-2009)
hal-00371169 , version 2 (01-06-2009)

Identifiants

Citer

Olivier Finkel. On Decidability Properties of One-Dimensional Cellular Automata. Journal of Cellular Automata, 2011, 6 (2-3), pp.181-193. ⟨hal-00371169v2⟩
365 Consultations
131 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More