On undecidability of equicontinuity classification for cellular automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2003

On undecidability of equicontinuity classification for cellular automata

Résumé

Equicontinuity classification is a popular classification of cellular automata based on their dynamical behavior. In this paper we prove that most of its classes are undecidable.
Fichier principal
Vignette du fichier
dmAB0110.pdf (112 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01183309 , version 1 (12-08-2015)

Identifiants

Citer

Bruno Durand, Enrico Formenti, Georges Varouchas. On undecidability of equicontinuity classification for cellular automata. Discrete Mathematics and Theoretical Computer Science, 2003, DMTCS Proceedings, DMTCS Proceedings vol. AB, Discrete Models for Complex Systems (DMCS'03), pp.117-128. ⟨10.46298/dmtcs.2302⟩. ⟨hal-01183309⟩
122 Consultations
882 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More