Random Generation for FinitelyAmbiguous Context-free Languages

Author： Bertoni Alberto   Goldwurm Massimiliano   Santini Massimo  

Publisher： Edp Sciences

E-ISSN： 1290-385x|35|6|499-512

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.35, Iss.6, 2010-03, pp. : 499-512

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

A characterization of poly-slender context-free languages

By Ilie Lucian   Rozenberg Grzegorz   Salomaa Arto  

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 1, 2010-03 ,pp. : 77-86

Edp Sciences

Access to resources Recommend Favorite

On differentiation functions, structure functions, and related languages of context-free grammars

By Dassow Jürgen   Mitrana Victor   Păun Gheorghe   Stiebe Ralf  

RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 3, 2010-03 ,pp. : 257-267

Edp Sciences

Access to resources Recommend Favorite

On context-free rewriting with a simple restriction and its computational completeness

By Masopust Tomáš   Meduna Alexander  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 2, 2009-03 ,pp. : 365-378

Edp Sciences

Access to resources Recommend Favorite

On the classes of languages accepted by limited context restarting automata∗∗∗∗∗∗

By Otto Friedrich   Černo Peter   Mráz František  

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 1, 2014-03 ,pp. : 61-84

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