On the computational power of context-free PC grammar systems

Author： Mandache N.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.237, Iss.1, 2000-04, pp. : 135-148

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

On the computational completeness of context-free parallel communicating grammar systems

By Csuhaj-Varju E.   Vaszil G.  

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 349-358

Elsevier

Access to resources Recommend Favorite

PC grammar systems with five context-free components generate all recursively enumerable languages

By Csuhaj-Varju E.   Paun G.   Vaszil G.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 785-794

Elsevier

Access to resources Recommend Favorite

Cooperation in context-free grammars

By Dassow J.   Mitrana V.  

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 353-361

Elsevier

Access to resources Recommend Favorite

Length considerations in context-free languages

By Raz D.  

Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. : 21-32

Elsevier

Access to resources Recommend Favorite

On lengths of words in context-free languages

By Ilie  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 327-359

Elsevier

Access to resources Recommend Favorite