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

Publisher： Elsevier

ISSN： 0304-3975

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

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 power of context-free PC grammar systems

By Mandache N.

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

Elsevier

Access to resources Recommend Favorite

Parallel communicating grammar systems with bounded resources

By Csuhaj-Varju E. Vaszil G.

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 205-219

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

Grouped partial ET0L systems and parallel multiple context-free grammars

By Nishida T.Y. Seki S.

Theoretical Computer Science, Vol. 246, Iss. 1, 2000-09 ,pp. : 131-150

Elsevier

Access to resources Recommend Favorite

Context-free parallel grammars and their applications to generating context-sensitive languages

By Lee Edward T

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 25, Iss. 4, 1996-04 ,pp. : 131-140

Emerald Group Publishing Ltd

Access to resources Recommend Favorite