On the equivalence of linear conjunctive grammars and trellis automata

E-ISSN： 1290-385x|38|1|69-88

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.38, Iss.1, 2010-03, pp. : 69-88

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

Tree Automata and Automata on Linear Orderings

By Bruyère Véronique Carton Olivier Sénizergues Géraud

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 2, 2009-04 ,pp. : 321-338

Edp Sciences

Access to resources Recommend Favorite

Linear grammars with one-sided contexts and their automaton representation∗

By Barash Mikhail Okhotin Alexander

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

Edp Sciences

Access to resources Recommend Favorite

Complexity results for prefix grammars

By Lohrey Markus Petersen Holger

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 2, 2010-03 ,pp. : 391-401

Edp Sciences

Access to resources Recommend Favorite

Weightreducing grammars and ultralinear languages

By Brandt Ulrike Delepine Ghislain Hermann K.-G. Walter Ulrike

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

Edp Sciences

Access to resources Recommend Favorite

From indexed grammars to generating functions∗

By Adams Jared Freden Eric Mishna Marni

RAIRO - Theoretical Informatics and Applications, Vol. 47, Iss. 4, 2013-11 ,pp. : 325-350

Edp Sciences

Access to resources Recommend Favorite