Left-forbidding cooperating distributed grammar systems
From MaRDI portal
Publication:708220
DOI10.1016/j.tcs.2010.06.010zbMath1207.68174MaRDI 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
descriptional complexity; generative power; cooperating derivation mode; cooperating distributed grammar system; left-forbidding grammar
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item