Three-way automata on rectangular tapes over a one-letter alphabet
Information Sciences: an International Journal
Handbook of formal languages, vol. 3
Automata, Languages, and Machines
Automata, Languages, and Machines
A Characterization of Recognizable Picture Languages
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
A SAT-based parser and completer for pictures specified by tiling
Pattern Recognition
Automata on a 2-dimensional tape
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
From determinism to non-determinism in recognizable two-dimensional languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Tiling automaton: a computational model for recognizable two-dimensional languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Weighted picture automata and weighted logics
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Simulating two-dimensional recognizability by pushdown and queue automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Fundamenta Informaticae
A brief excursion inside the class of tiling recognizable two-dimensional languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Comparing necessary conditions for recognizability of two-dimensional languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Simulations over two-dimensional on-line tessellation automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
Tiling systems are a well accepted model to define recognizable two-dimensional languages but they are not an effective device for recognition unless a scanning strategy for the pictures is fixed. We define a tiling automaton as a tiling system equipped with a scanning strategy and a suitable data structure. The class of languages accepted by tiling automata coincides with the REC family. In this framework it is possible to define determinism, non-determinism and unambiguity. Then (deterministic) tiling automata are compared with the other known (deterministic) automata models for two-dimensional languages.