Left-forbidding cooperating distributed grammar systems

DOI10.1016/J.TCS.2010.06.010zbMath1207.68174OpenAlexW1974340358MaRDI QIDQ708220

Tomáš Masopust, Alexander Meduna, Filip Goldefus

Publication date: 11 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.010

zbMATH Keywords

descriptional complexitygenerative powercooperating derivation modecooperating distributed grammar systemleft-forbidding grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Distributed systems (68M14)

Related Items (3)

One-Sided Random Context Grammars: A Survey ⋮ Unnamed Item ⋮ One-sided random context grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri net algorithms in the theory of matrix grammars
• A shrinking lemma for random forbidding context languages
• A hierarchy between context-free and context-sensitive languages
• ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS
• A pumping lemma for random permitting context languages

This page was built for publication: Left-forbidding cooperating distributed grammar systems