A Greibach normal form for context-free graph grammars
From MaRDI portal
Publication:5204313
Recommendations
Cites work
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4049099 (Why is no real title available?)
- scientific article; zbMATH DE number 4051027 (Why is no real title available?)
- scientific article; zbMATH DE number 4053039 (Why is no real title available?)
- scientific article; zbMATH DE number 4060748 (Why is no real title available?)
- scientific article; zbMATH DE number 4060749 (Why is no real title available?)
- scientific article; zbMATH DE number 4106286 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 17539 (Why is no real title available?)
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 219258 (Why is no real title available?)
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Apex graph grammars and attribute grammars
- Boundary graph grammars with dynamic edge relabeling
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Derivation-bounded languages
- Graph expressions and graph rewritings
- Hyperedge replacement: grammars and languages
- Hypergraph languages of bounded degree
- Linear graph grammars: Power and complexity
- Matrix Equations and Normal Forms for Context-Free Grammars
- Nonterminal separation in graph grammars
- The complexity of finding uniform emulations on paths and ring networks
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The string generating power of context-free hypergraph grammars
Cited in
(13)- Double Greibach operator grammars
- The normal form of lattice-valued context free grammars
- A Local Greibach Normal Form for Hyperedge Replacement Grammars
- Abstracting Complex Data Structures by Hyperedge Replacement
- scientific article; zbMATH DE number 7456053 (Why is no real title available?)
- Hypergraph languages of bounded degree
- scientific article; zbMATH DE number 4064512 (Why is no real title available?)
- 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
- Normal forms for context-free node-rewriting hypergraph grammars
- Hypergraph basic categorial grammars
- An elementary proof of double Greibach normal form
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)
