Three-way automata on rectangular tapes over a one-letter alphabet
Information Sciences: an International Journal
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation
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
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
Simulating two-dimensional recognizability by pushdown and queue automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
On Complexity of Two Dimensional Languages Generated by Transducers
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Picture Languages: From Wang Tiles to 2D Grammars
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
A computational model for tiling recognizable two-dimensional languages
Theoretical Computer Science
Picture Recognizability with Automata Based on Wang Tiles
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Tiling recognizable two-dimensional languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Fundamenta Informaticae
Transducer generated arrays of robotic nano-arms
Natural Computing: an international journal
Towards more expressive 2D deterministic automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
| Hi-index | 0.00 |
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 (deterministic) tiling automata are compared with the other known (deterministic) automata models for recognition of two-dimensional languages.