On the power of permitting features in cooperating context-free array grammar systems
From MaRDI portal
Publication:387871
DOI10.1016/j.dam.2012.08.036zbMath1296.68089OpenAlexW2089666943MaRDI QIDQ387871
K. G. Subramanian, Ibrahim Venkat, Erzsébet Csuhaj-Varjú
Publication date: 17 December 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.036
Related Items
Unnamed Item ⋮ Unnamed Item ⋮ Improved descriptional complexity results on generalized forbidding grammars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pure 2D picture grammars and languages
- A shrinking lemma for random forbidding context languages
- On Some Classes of 2D Languages and Their Relations
- Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
- ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS
- Picture Languages: From Wang Tiles to 2D Grammars
- Parallel/sequential rectangular arrays with tables
- A pumping lemma for random permitting context languages