PC grammar systems with five context-free components generate all recursively enumerable languages.
type: Item
instance of: scholarly article
title: PC grammar systems with five context-free components generate all recursively enumerable languages.
zbMATH Open document ID: 1042.68057
DOI: 10.1016/S0304-3975(02)00852-6
author: Erzsébet Csuhaj-Varjú
author: György Vaszil
author: Gheorghe Păun
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1915598
zbMATH Keywords: Parallel communicating grammar systems
zbMATH Keywords: Descriptional complexity
zbMATH Keywords: Recursively enumerable languages
MaRDI profile type: Publication
cites work: Q4782094
cites work: Q4763798
cites work: On the computational completeness of context-free parallel communicating grammar systems
cites work: Parallel communicating grammar systems with bounded resources
cites work: Q4714446
cites work: Q3798273
cites work: On the computational power of context-free PC grammar systems
cites work: Q3982094
full work available at URL: s0304-3975(02)00852-6
OpenAlex ID: W2092508863
description: scientific article; zbMATH DE number 1915598