Picture walking automata were introduced by M. Blum and C. Hewitt in 1967 as a generalization of one-dimensional two-way finite automata to recognize pictures, or two-dimensional words. Several variants have been investigated since then, including deterministic, non-deterministic and alternating transition rules; four-, three- and two-way movements; single- and multi-headed variants; automata that must stay inside the input picture, or that may move outside. We survey results that compare the recognition power of different variants, consider their basic closure properties and study decidability questions. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kari, J., & Salo, V. (2011). A survey on picture-walking automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7020 LNCS, pp. 183–213). https://doi.org/10.1007/978-3-642-24897-9_9
Mendeley helps you to discover research relevant for your work.