Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods

In this paper we study language recognition by two-dimensional 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 .

• Type: Conference
• Year: 2007
• Where: MFCS
• Authors: Martin Delacourt, Victor Poupet
• Keywords: Complete Neighborhood, Different Possible Neighborhoods, MFCS 2007, Two-dimensional Cellular Automata