Comparing the succinctness of monadic query languages over finite trees

E-ISSN： 1290-385x|38|4|343-373

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.38, Iss.4, 2010-03, pp. : 343-373

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

Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata

By Mereghetti Carlo Palano Beatrice Pighizzini Giovanni

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 5, 2010-03 ,pp. : 477-490

Edp Sciences

Access to resources Recommend Favorite

Polynomial languages with finite antidictionaries

By Shur Arseny M.

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 2, 2008-11 ,pp. : 269-279

Edp Sciences

Access to resources Recommend Favorite

Consensual languages and matching finite-state computations

By Crespi Reghizzi Stefano San Pietro Pierluigi

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 1, 2011-03 ,pp. : 77-97

Edp Sciences

Access to resources Recommend Favorite

Languages of finite words occurring infinitely many times in an infinite word

By Thomsen Klaus

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 4, 2010-03 ,pp. : 641-650

Edp Sciences

Access to resources Recommend Favorite

The pseudovariety of semigroups of triangular matrices over a finite field

By Almeida Jorge Margolis Stuart W. Volkov Mikhail V.

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 1, 2010-03 ,pp. : 31-48

Edp Sciences

Access to resources Recommend Favorite