Skip to Main content Skip to Navigation
Journal articles

On undecidability of equicontinuity classification for cellular automata

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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01183309
Contributor : Coordination Episciences Iam <>
Submitted on : Wednesday, August 12, 2015 - 10:06:23 AM
Last modification on : Wednesday, September 11, 2019 - 3:28:02 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:34:37 AM

File

dmAB0110.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01183309, version 1

Collections

Citation

Bruno Durand, Enrico Formenti, Georges Varouchas. On undecidability of equicontinuity classification for cellular automata. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2003, DMTCS Proceedings, DMTCS Proceedings vol. AB, Discrete Models for Complex Systems (DMCS'03), pp.117-128. ⟨hal-01183309⟩

Share

Metrics

Record views

264

Files downloads

703