Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Lonati, V., & Pradella, M. (2011). Towards more expressive 2D deterministic automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6807 LNCS, pp. 225–237). https://doi.org/10.1007/978-3-642-22256-6_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
