On the size complexity of non-returning context-free PC grammar systems

Erzsébet Csuhaj-Varjú, György Vaszil

Research output: Contribution to journalConference article

3 Citations (Scopus)

Abstract

Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components. We also present a non-returning universal PC grammar system generating unary languages, that is, a system where not only the number of components, but also the number of productions and the number of nonterminals are limited by certain constants, and these size parameters do not depend on the generated language.

Original languageEnglish
Pages (from-to)91-100
Number of pages10
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume3
DOIs
Publication statusPublished - Jul 30 2009
Event11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009 - Magdeburg, Germany
Duration: Jul 6 2009Jul 9 2009

ASJC Scopus subject areas

  • Software

Cite this