• M.MARIMUTHU
• M.KAVITHA

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, nondeterminism 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 tiling automata are compared with the other known automata models for recognition of two-dimensional languages.

Automata, Formal Languages, Two-dimensional languages, Equivalence theorem, Tiling system

"TWO -DIMENSIONAL LANGUAGE IN AUTOMATA", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.883-890, June 2019, Available :http://www.jetir.org/papers/JETIR1906U19.pdf

"TWO -DIMENSIONAL LANGUAGE IN AUTOMATA", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp883-890, June 2019, Available at : http://www.jetir.org/papers/JETIR1906U19.pdf