On the computational power of context-free PC grammar systems
type: Item
instance of: scholarly article
title: On the computational power of context-free PC grammar systems
zbMATH Open document ID: 0939.68058
DOI: 10.1016/S0304-3975(98)00159-5
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1454558
zbMATH Keywords: parallel grammar systems
zbMATH Keywords: system of diophantic equations
zbMATH Keywords: synchronization
author: Niculae Mandache
MaRDI profile type: Publication
cites work: Q4886800
cites work: Q4319710
cites work: Q3893911
cites work: Q4714446
cites work: Q3686043
cites work: Nonreturning PC grammar systems can be simulated by returning systems
cites work: Register machine proof of the theorem on exponential diophantine representation of enumerable sets
cites work: Q5613949
cites work: Q3982094
full work available at URL: s0304-3975(98)00159-5
OpenAlex ID: W2001356001
Recommended article: Q5146519
Recommended article: On the computational completeness of context-free parallel communicating grammar systems
Recommended article: Q5698703
Recommended article: The computational power of parsing expression grammars
Recommended article: Q4878713
Recommended article: On Centralized PC Grammar Systems with Context-Sensitive Components
Recommended article: Q4015487
Recommended article: A note on the expressive power of probabilistic context free grammars
Recommended article: Q4939189
description: scientific article; zbMATH DE number 1454558