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.
KeywordsConvex Hull Cellular Automaton Neighborhood Versus Input Word Language Recognition
Unable to display preview. Download preview PDF.
- 6.Ibarra, O.: 6. In: Cellular Automata: a Parallel Model, Mathematics and its applications edn., pp. 181–197. Kluwer, Dordrecht (1999)Google Scholar
- 7.Poupet, V.: Cellular automata: Real-time equivalence between one-dimensional neighborhoods. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 133–144. Springer, Heidelberg (2005)Google Scholar