Edge-label controlled graph grammars
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3644498 (Why is no real title available?)
- scientific article; zbMATH DE number 3827231 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 965 (Why is no real title available?)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- An “Interchange Lemma” for Context-Free Languages
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Decision problems for node label controlled graph grammars
- Direction independent context-sensitive grammars
- Graph grammars with neighbourhood-controlled embedding
- Handle NLC grammars and r. e. languages
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
Cited in
(11)- Adaptive Star Grammars for Graph Models
- Representing graph families with edge grammars
- scientific article; zbMATH DE number 4049107 (Why is no real title available?)
- scientific article; zbMATH DE number 1089086 (Why is no real title available?)
- Handle-rewriting hypergraph grammars
- Boundary graph grammars with dynamic edge relabeling
- Node replacement graph grammars with dynamic node relabeling
- scientific article; zbMATH DE number 4182839 (Why is no real title available?)
- Translating controlled graph grammars to ordinary graph grammars
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- scientific article; zbMATH DE number 4049103 (Why is no real title available?)
This page was built for publication: Edge-label controlled graph grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q909484)