Towards More Expressive 2D Deterministic Automata
REC defines an important class of picture languages that is considered a 2D analogous of regular languages. In this paper we recall some of the most expressive operational approaches to define deterministic subclasses of REC. We summarize their main characteristics and properties and try to understand if it is possible to combine their main features to define a larger deterministic subclass. We conclude by proposing a convenient generalization based on automata and study some of its formal properties.
Unable to display preview. Download preview PDF.
- 5.Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: Conference Record of 1967 Eighth Annual Symposium on Switching and Automata Theory, pp. 155–160. IEEE, Los Alamitos (1967)Google Scholar
- 13.Lonati, V., Pradella, M.: Strategies to scan pictures with automata based on Wang tiles. R.A.I.R.O. Theoretical Informatics and Applications 44 (2010)Google Scholar