A Greibach normal form for context-free graph grammars
From MaRDI portal
Publication:5204313
DOI10.1007/3-540-55719-9_70zbMATH Open1425.68162OpenAlexW2152195025MaRDI QIDQ5204313FDOQ5204313
Authors: Joost Engelfriet 
Publication date: 4 December 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55719-9_70
Recommendations
Cites Work
- Title not available (Why is that?)
- Hyperedge replacement: grammars and languages
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Title not available (Why is that?)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Apex graph grammars and attribute grammars
- Linear graph grammars: Power and complexity
- Nonterminal separation in graph grammars
- Boundary graph grammars with dynamic edge relabeling
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Title not available (Why is that?)
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Graph expressions and graph rewritings
- Title not available (Why is that?)
- The complexity of finding uniform emulations on paths and ring networks
- Derivation-bounded languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix Equations and Normal Forms for Context-Free Grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- The string generating power of context-free hypergraph grammars
- Title not available (Why is that?)
- Hypergraph languages of bounded degree
Cited In (13)
- A Local Greibach Normal Form for Hyperedge Replacement Grammars
- Abstracting Complex Data Structures by Hyperedge Replacement
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergraph languages of bounded degree
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM
- Hypergraph basic categorial grammars
- Normal forms for context-free node-rewriting hypergraph grammars
- An elementary proof of double Greibach normal form
- Double Greibach operator grammars
- The normal form of lattice-valued context free grammars
This page was built for publication: A Greibach normal form for context-free graph grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204313)
