Skip to main content
Journal ArticleOPEN ACCESS

On undecidability of equicontinuity classification for cellular automata

  • Durand B
  • Formenti E
  • Varouchas G
Discrete Mathematics & Theoretical Computer Science (2003) DMTCS Proceedings vol. AB,...(Proceedings)
DOI: 10.46298/dmtcs.2302
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Durand, B., Formenti, E., & Varouchas, G. (2003). On undecidability of equicontinuity classification for cellular automata. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AB,...(Proceedings). https://doi.org/10.46298/dmtcs.2302

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free