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.
Towards more expressive 2D deterministic automata / V. Lonati, M. Pradella - In: Implementation and application of automata : 16th international conference, CIAA 2011, Blois, France, July 13-16, 2011 : revised selected papers / [a cura di] B. Bouchou-Markhoff, P. Caron, J.M. Champarnaud, D. Maurel. - Berlin : Springer, 2011 Jul. - ISBN 9783642222559. - pp. 225-238 (( Intervento presentato al 16. convegno International Conference on Implementation and application of automata tenutosi a Blois, France nel 2011 [10.1007/978-3-642-22256-6_21].
Towards more expressive 2D deterministic automata
V. LonatiPrimo
;
2011
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
