Left-forbidding cooperating distributed grammar systems
type: Item
instance of: scholarly article
title: Left-forbidding cooperating distributed grammar systems
zbMATH Open document ID: 1207.68174
author: Filip Goldefus
author: Tomáš Masopust
author: Alexander Meduna
published in: Theoretical Computer Science
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 5798138
zbMATH Keywords: cooperating distributed grammar system
zbMATH Keywords: cooperating derivation mode
zbMATH Keywords: left-forbidding grammar
zbMATH Keywords: generative power
zbMATH Keywords: descriptional complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.06.010
OpenAlex ID: W1974340358
cites work: Q3468618
cites work: Q4763798
cites work: A shrinking lemma for random forbidding context languages
cites work: A pumping lemma for random permitting context languages
cites work: ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS
cites work: Q5678435
cites work: A hierarchy between context-free and context-sensitive languages
cites work: Q3801102
cites work: Q3798273
cites work: Petri net algorithms in the theory of matrix grammars
DOI: 10.1016/J.TCS.2010.06.010
description: scientific article; zbMATH DE number 5798138