On Decidability Properties of One-Dimensional Cellular AutomataReport as inadecuate

On Decidability Properties of One-Dimensional Cellular Automata - Download this document for free, or read online. Document in PDF available to download.

1 ELM - Équipe de Logique Mathématique 2 LIP - Laboratoire de l-Informatique du Parallélisme

Abstract : 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.

Keywords : reachability relation One-dimensional cellular automaton space of configurations omega-automatic structures first order theory cardinality quantifiers decidability properties surjective cellular automaton automatic graph reachability relation.

Author: Olivier Finkel -

Source: https://hal.archives-ouvertes.fr/


Related documents