Handle NLC grammars and r. e. languages
From MaRDI portal
Publication:1092670
DOI10.1016/0022-0000(87)90012-2zbMath0627.68058OpenAlexW1989196587MaRDI QIDQ1092670
Grzegorz Rozenberg, Michael G. Main
Publication date: 1987
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(87)90012-2
generating powerhandle NLC grammarsnode-label controlled graph grammarsrecursively enumerable graph language
Related Items (4)
Handle-rewriting hypergraph grammars ⋮ Edge-label controlled graph grammars ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ Node replacement graph grammars with dynamic node relabeling
Cites Work
- Restrictions on NLC graph grammars
- Characteristics of graph languages generated by edge replacement
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- A system of graph grammars which generates all recursively enumerable sets of labelled graphs
- A characterization of context-free string languages by directed node- label controlled graph grammars
- Decision problems for node label controlled graph grammars
- Graph grammars with neighbourhood-controlled embedding
- Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Handle NLC grammars and r. e. languages