An upper bound on the complexity of recognizable tree languages

Author： Finkel Olivier   Lecomte Dominique   Simonnet Pierre  

Publisher： Edp Sciences

E-ISSN： 1290-385x|49|2|121-137

ISSN： 0988-3754

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

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

An Upper Bound on the Space Complexity of Random Formulae in Resolution

By Zito Michele  

RAIRO - Theoretical Informatics and Applications, Vol. 36, Iss. 4, 2010-03 ,pp. : 329-339

Edp Sciences

Access to resources Recommend Favorite

Unambiguous recognizable two-dimensional languages

By Anselmo Marcella   Giammarresi Dora   Madonia Maria   Restivo Antonio  

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

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

Tree algebra of sofic tree languages∗

By Aubrun Nathalie   Béal Marie–Pierre  

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 4, 2014-10 ,pp. : 431-451

Edp Sciences

Access to resources Recommend Favorite

On the syntactic complexity of tree series

By Bozapalidis Symeon   Kalampakas Antonios  

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 2, 2010-05 ,pp. : 257-279

Edp Sciences

Access to resources Recommend Favorite