On the computational completeness of context-free parallel communicating grammar systems
type: Item
instance of: scholarly article
title: On the computational completeness of context-free parallel communicating grammar systems
zbMATH Open document ID: 0915.68108
DOI: 10.1016/S0304-3975(98)00193-5
author: Erzsébet Csuhaj-Varjú
author: György Vaszil
published in: Theoretical Computer Science
publication date: 1999-04-29T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1282187
zbMATH Keywords: recursively enumerable languages
zbMATH Keywords: context-free returning parallel communicating grammar systems
MaRDI profile type: Publication
cites work: Q4290611
cites work: Q4714446
cites work: Nonreturning PC grammar systems can be simulated by returning systems
cites work: Turing machines with restricted memory access
cites work: Q5592246
cites work: On the computational power of context-free PC grammar systems
cites work: Q4226189
cites work: Q3982094
cites work: Q5678435
full work available at URL: s0304-3975(98)00193-5
OpenAlex ID: W1995375035
description: scientific article; zbMATH DE number 1282187