PC grammar systems with five context-free components generate all recursively enumerable languages

E. Csuhaj-Varjú, Gheorghe Pǎun, György Vaszil

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language.

Original languageEnglish
Pages (from-to)785-794
Number of pages10
JournalTheoretical Computer Science
Volume299
Issue number1-3
DOIs
Publication statusPublished - Apr 18 2003

Fingerprint

Recursively Enumerable Languages
Context free grammars
Turing machines
Grammar
Context-free Grammar
Turing Machine
Strings
Context

Keywords

  • Descriptional complexity
  • Parallel communicating grammar systems
  • Recursively enumerable languages

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

PC grammar systems with five context-free components generate all recursively enumerable languages. / Csuhaj-Varjú, E.; Pǎun, Gheorghe; Vaszil, György.

In: Theoretical Computer Science, Vol. 299, No. 1-3, 18.04.2003, p. 785-794.

Research output: Contribution to journalArticle

@article{c20f2a0d8651427e8adb25c4c1f88cad,
title = "PC grammar systems with five context-free components generate all recursively enumerable languages",
abstract = "Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language.",
keywords = "Descriptional complexity, Parallel communicating grammar systems, Recursively enumerable languages",
author = "E. Csuhaj-Varj{\'u} and Gheorghe Pǎun and Gy{\"o}rgy Vaszil",
year = "2003",
month = "4",
day = "18",
doi = "10.1016/S0304-3975(02)00852-6",
language = "English",
volume = "299",
pages = "785--794",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - PC grammar systems with five context-free components generate all recursively enumerable languages

AU - Csuhaj-Varjú, E.

AU - Pǎun, Gheorghe

AU - Vaszil, György

PY - 2003/4/18

Y1 - 2003/4/18

N2 - Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language.

AB - Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language.

KW - Descriptional complexity

KW - Parallel communicating grammar systems

KW - Recursively enumerable languages

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

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

U2 - 10.1016/S0304-3975(02)00852-6

DO - 10.1016/S0304-3975(02)00852-6

M3 - Article

AN - SCOPUS:0037453375

VL - 299

SP - 785

EP - 794

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -