Parallel communicating grammar systems with bounded resources

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

Research output: Contribution to journalArticle

3 Citations (Scopus)


In this paper we study size properties of context-free returning parallel communicating grammar systems (PC grammar systems). We show that for each context-free returning PC grammar system an equivalent system of this type can be constructed, where the total number of symbols used for describing a component can be bounded by a reasonably small constant. Since context-free returning PC grammar systems determine the class of recursively enumerable languages, the result also demonstrates that the recursively enumerable language class can be economically described in terms of parallel communicating grammar systems.

Original languageEnglish
Pages (from-to)205-219
Number of pages15
JournalTheoretical Computer Science
Issue number1-2
Publication statusPublished - Apr 6 2002


  • Grammar systems
  • Recursively enumerable languages
  • Size complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Parallel communicating grammar systems with bounded resources'. Together they form a unique fingerprint.

  • Cite this