Real time language recognition on 2D cellular automata: dealing with non-convex neighborhoods

Authors:
Martin Delacourt;Victor Poupet
Affiliations:
LIP (UMR 5668 - CNRS, ENS Lyon, UCB Lyon, INRIA), ENS Lyon, LYON cedex, France;LIP (UMR 5668 - CNRS, ENS Lyon, UCB Lyon, INRIA), ENS Lyon, LYON cedex, France
Venue:
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Year:
2007

Citing 8
Cited 0

Relating the power of cellular arrays to their closure properties

Theoretical Computer Science
Computation theoretic aspects of cellular automata

Physica D
Language not recognizable in real time by one-way cellular automata

Theoretical 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)
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

IEEE Transactions on Computers
Real-time language recognition by one-dimensional cellular automata

Journal of Computer and System Sciences
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	0.00

Visualization

Abstract

In this paper we study language recognition by twodimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearly equivalent we focus on a natural sub-linear complexity class: the real time. We show that any complete neighborhood is sufficient to recognize in real time any language that can be recognized in real-time by a cellular automaton working on the convex hull of V.