| author: | Bruno Durand, Enrico Formenti and Georges Varouchas |
|---|---|
| title: | On undecidability of equicontinuity classification for cellular automata |
| keywords: | cellular automata, classification, discrete dynamical systems, undecidability |
| 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. |
| If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
| reference: | Bruno Durand and Enrico Formenti and Georges Varouchas (2003), On undecidability of equicontinuity classification for cellular automata, in Discrete Models for Complex Systems, DMCS'03, Michel Morvan and Éric Rémila (eds.), Discrete Mathematics and Theoretical Computer Science Proceedings AB, pp. 117-128 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dmAB0110.ps.gz (60 K) |
| ps-source: | dmAB0110.ps (152 K) |
| pdf-source: | dmAB0110.pdf (116 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.