On the computational completeness of context-free parallel communicating grammar systems

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

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete. Moreover, we prove that systems with a bounded number of components are sufficient to reach this generative power.

Original languageEnglish
Pages (from-to)349-358
Number of pages10
JournalTheoretical Computer Science
Volume215
Issue number1-2
Publication statusPublished - Feb 28 1999

Fingerprint

Turing machines
Grammar
Completeness
Recursively Enumerable Languages
Turing Machine
Number of Components
Sufficient
Context
Class

Keywords

  • Computational completeness
  • Distributed computation
  • Parallel communicating grammar systems

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On the computational completeness of context-free parallel communicating grammar systems. / Csuhaj-Varjú, Erzsébet; Vaszil, György.

In: Theoretical Computer Science, Vol. 215, No. 1-2, 28.02.1999, p. 349-358.

Research output: Contribution to journalArticle

@article{cfa8b90f80864e848d1e3c482289a7d4,
title = "On the computational completeness of context-free parallel communicating grammar systems",
abstract = "We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete. Moreover, we prove that systems with a bounded number of components are sufficient to reach this generative power.",
keywords = "Computational completeness, Distributed computation, Parallel communicating grammar systems",
author = "Erzs{\'e}bet Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil",
year = "1999",
month = "2",
day = "28",
language = "English",
volume = "215",
pages = "349--358",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - On the computational completeness of context-free parallel communicating grammar systems

AU - Csuhaj-Varjú, Erzsébet

AU - Vaszil, György

PY - 1999/2/28

Y1 - 1999/2/28

N2 - We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete. Moreover, we prove that systems with a bounded number of components are sufficient to reach this generative power.

AB - We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete. Moreover, we prove that systems with a bounded number of components are sufficient to reach this generative power.

KW - Computational completeness

KW - Distributed computation

KW - Parallel communicating grammar systems

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

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

M3 - Article

AN - SCOPUS:0346304138

VL - 215

SP - 349

EP - 358

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -