Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Delacourt, M., & Poupet, V. (2007). Real time language recognition on 2D cellular automata: Dealing with non-convex neighborhoods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 298–309). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
