On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms

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

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

In this paper we study the generative power of context-free returning parallel communicating grammar systems using different synchronization mechanisms and communication protocols. We demonstrate the equivalence of several types of these systems and present normal form theorems showing that all languages generated by context-free returning parallel communicating grammar systems can also be generated by such systems having only rules of the form X → α, where α consists of at most two symbols and if X → α is a query rule, then α is a single query symbol.

Original languageEnglish
Pages (from-to)511-538
Number of pages28
JournalTheoretical Computer Science
Volume255
Issue number1-2
DOIs
Publication statusPublished - Aug 7 2001

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this