Tiling automaton: A computational model for recognizable two-dimensional languages

Two-dimensional languages can be recognized by tiling systems. A tiling system becomes an effective device for recognition when a scanning strategy on pictures is fixed. We define a Tiling Automaton as a tiling system together with a scanning strategy and a suitable data structure. In this framework it is possible to define determinism, non-determinism and unambiguity. The class of languages accepted by tiling automata coincides with REC family. Tiling automata are able to simulate on-line tessellation automata. Then (deterministic) tiling automata are compared with the other known (deterministic) automata models for recognition of two-dimensional languages. © Springer-Verlag Berlin Heidelberg 2007