Two-dimensional cellular automata and deterministic on-line tessalation automata☆

https://doi.org/10.1016/S0304-3975(02)00575-3Get rights and content
Under an Elsevier user license
open archive

Abstract

In this work we consider the relationships between the classes of two-dimensional languages defined by deterministic on-line tessellation automata and by real time two-dimensional cellular automata with Moore and Von Neumann neighborhood. We generalize the result known for one-dimensional cellular automata to two-dimensional cellular automata with Von Neumann neighborhood: the class of real time cellular automata is closed under rotation of 180° if and only if real time cellular automata is equivalent to linear time cellular automata.

Keywords

Cellular automata
Deterministic on-line tessalation automata
Real time
Linear time
Closure property

Cited by (0)

☆

This work was initiated during a stay in Santiago supported by la coopération franco-chilienne du ministère des affaires étrangères.

Copyright © 2002 Elsevier Science B.V. All rights reserved.