HAL : hal-00371169, version 2

arXiv : 0903.4615

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

Journal of Cellular Automata 6, 2-3 (2011) 181-193

Versions disponibles :

v1 (26-03-2009)

v2 (01-06-2009)

On Decidability Properties of One-Dimensional Cellular Automata

Olivier Finkel 1, 2

(2011)

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.

1 :	Équipe de Logique Mathématique (ELM)
	CNRS : UMR7056 – Université Paris VII - Paris Diderot
2 :	Laboratoire de l'Informatique du Parallélisme (LIP)
	Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I

Domaine

:

Informatique/Logique en informatique Informatique/Complexité Mathématiques/Logique

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

hal-00371169, version 2

http://hal.archives-ouvertes.fr/hal-00371169

oai:hal.archives-ouvertes.fr:hal-00371169

Contributeur : Olivier Finkel <>

Soumis le : Lundi 1 Juin 2009, 15:49:45

Dernière modification le : Jeudi 30 Septembre 2010, 10:54:02