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.
Description
Towards More Expressive 2D Deterministic Automata - Springer
%0 Book Section
%1 lonati2011towards
%A Lonati, Violetta
%A Pradella, Matteo
%B Implementation and Application of Automata
%D 2011
%E Bouchou-Markhoff, Béatrice
%E Caron, Pascal
%E Champarnaud, Jean-Marc
%E Maurel, Denis
%I Springer Berlin Heidelberg
%K 2013 automata deterministic informatik project theoretische
%P 225-237
%R 10.1007/978-3-642-22256-6_21
%T Towards More Expressive 2D Deterministic Automata
%U http://dx.doi.org/10.1007/978-3-642-22256-6_21
%V 6807
%X 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.
%@ 978-3-642-22255-9
@incollection{lonati2011towards,
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.},
added-at = {2013-06-29T16:10:59.000+0200},
author = {Lonati, Violetta and Pradella, Matteo},
biburl = {https://www.bibsonomy.org/bibtex/220a36c936b5e1cbb8b35b40eb31296fb/s_6wg2xw},
booktitle = {Implementation and Application of Automata},
description = {Towards More Expressive 2D Deterministic Automata - Springer},
doi = {10.1007/978-3-642-22256-6_21},
editor = {Bouchou-Markhoff, Béatrice and Caron, Pascal and Champarnaud, Jean-Marc and Maurel, Denis},
interhash = {7b8b752b1f89c234ea406678d7c298f2},
intrahash = {20a36c936b5e1cbb8b35b40eb31296fb},
isbn = {978-3-642-22255-9},
keywords = {2013 automata deterministic informatik project theoretische},
pages = {225-237},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
timestamp = {2014-04-07T15:55:01.000+0200},
title = {Towards More Expressive 2D Deterministic Automata},
url = {http://dx.doi.org/10.1007/978-3-642-22256-6_21},
volume = 6807,
year = 2011
}