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

E-ISSN： 1290-385x|43|2|365-378

ISSN： 0988-3754

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

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

Random Generation for FinitelyAmbiguous Context-free Languages

By Bertoni Alberto Goldwurm Massimiliano Santini Massimo

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

Edp Sciences

Access to resources Recommend Favorite

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

QUANTIFYING BIOLOGICAL INTEGRITY BY TAXONOMIC COMPLETENESS: ITS UTILITY IN REGIONAL AND GLOBAL ASSESSMENTS

Ecological Applications, Vol. 16, Iss. 4, 2006-08 ,pp. : 1277-1294

John Wiley & Sons Inc

Access to resources Recommend Favorite

Experimental and computational investigation of the aerodynamic noise generated by simple in-duct spoilers

By Waddington D.C. Mak C.M. Oldham D.J.

INTER-NOISE and NOISE-CON Congress and Conference Proceedings, Vol. 1998, Iss. 5, 1998-10 ,pp. : 776-779

Institute of Noise Control Engineering

Access to resources Recommend Favorite