On undecidability of equicontinuity classification for cellular automata - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2003

On undecidability of equicontinuity classification for cellular automata

(1) , (1) , (1)
1

Abstract

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
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
112 View
737 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More