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

E. 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 - 2001

Fingerprint

Grammar
Normal Form
Synchronization
Network protocols
Communication
Query
Communication Protocol
Equivalence
Context
Theorem
Demonstrate

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On context-free parallel communicating grammar systems : Synchronization, communication, and normal forms. / Csuhaj-Varjú, E.; Vaszil, György.

In: Theoretical Computer Science, Vol. 255, No. 1-2, 2001, p. 511-538.

Research output: Contribution to journalArticle

@article{0397edb82414436abe8a353d112e4374,
title = "On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms",
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.",
author = "E. Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil",
year = "2001",
doi = "10.1016/S0304-3975(99)00318-7",
language = "English",
volume = "255",
pages = "511--538",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - On context-free parallel communicating grammar systems

T2 - Synchronization, communication, and normal forms

AU - Csuhaj-Varjú, E.

AU - Vaszil, György

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034922057&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034922057&partnerID=8YFLogxK

U2 - 10.1016/S0304-3975(99)00318-7

DO - 10.1016/S0304-3975(99)00318-7

M3 - Article

AN - SCOPUS:0034922057

VL - 255

SP - 511

EP - 538

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -