On the Nonterminal Complexity of Tree Controlled Grammars
From MaRDI portal
Publication:3166957
DOI10.1007/978-3-642-31644-9_18zbMath1367.68155OpenAlexW13148084MaRDI QIDQ3166957
Publication date: 1 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_18
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonterminal complexity of tree controlled grammars
- Tree controlled grammars
- On the generative capacity of tree controlled grammars
- GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS
- Computing with Cells
- Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity
This page was built for publication: On the Nonterminal Complexity of Tree Controlled Grammars