Two-dimensional cellular automata and their neighborhoods

Authors:
Véronique Terrier
Affiliations:
GREYC, Campus II, Université de Caen, F-14032 Caen Cedex, France
Venue:
Theoretical Computer Science
Year:
2004

Citing 3
Cited 3

A linear speed-up theorem for cellular automata

Theoretical Computer Science - Special issue on logic and applications to computer science
Two-dimensional cellular automata recognizer

Theoretical Computer Science - Special issue on Caen '97
Simple Computation-Universal Cellular Spaces

Journal of the ACM (JACM)

Closure properties of cellular automata

Theoretical Computer Science
Automorphissm Classification of Cellular Automata

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Cellular automata: real-time equivalence between one-dimensional neighborhoods

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We investigate how the choice of the neighborhood can influence the computation ability of two-dimensional cellular automata. We present also a strict inclusion between low and high complexity classes of two-dimensional cellular automata.