Unambiguous recognizable two-dimensional languages

Author： Anselmo Marcella   Giammarresi Dora   Madonia Maria   Restivo Antonio  

Publisher： Edp Sciences

E-ISSN： 1290-385x|40|2|277-293

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.40, Iss.2, 2006-07, pp. : 277-293

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Classes of two-dimensional languages and recognizability conditions

By Anselmo Marcella   Madonia Maria  

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 4, 2011-02 ,pp. : 471-488

Edp Sciences

Access to resources Recommend Favorite

An upper bound on the complexity of recognizable tree languages

By Finkel Olivier   Lecomte Dominique   Simonnet Pierre  

RAIRO - Theoretical Informatics and Applications, Vol. 49, Iss. 2, 2015-07 ,pp. : 121-137

Edp Sciences

Access to resources Recommend Favorite

Free group languages: Rational versus recognizable

By Silva Pedro V.  

RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 1, 2010-03 ,pp. : 49-67

Edp Sciences

Access to resources Recommend Favorite

Two-dimensional Sgraffito automata∗∗∗

By Průša Daniel   Mráz František   Otto Friedrich  

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 5, 2015-01 ,pp. : 505-539

Edp Sciences

Access to resources Recommend Favorite

Multi-dimensional sets recognizable in all abstract numeration systems

By Charlier Émilie   Lacroix Anne   Rampersad Narad  

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 1, 2012-03 ,pp. : 51-65

Edp Sciences

Access to resources Recommend Favorite