The term generating power of context-free hypergraph grammars
From MaRDI portal
Recommendations
- The string generating power of context-free hypergraph grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- The generative power of context-free node rewriting in hypergraphs
- Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
- scientific article; zbMATH DE number 4041305
- Context-free grammars, generating functions and combinatorial arrays
- The generating power of boundary NLC graph grammars and cycle graphs
- Context-free handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 165817
- Powerful and NP-complete: hypergraph Lambek grammars
Cited in
(7)- The string generating power of context-free hypergraph grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Declarative term graph attribution for program generation
- The Complexity of Languages Generated by Attribute Grammars
- scientific article; zbMATH DE number 4080942 (Why is no real title available?)
- scientific article; zbMATH DE number 1268708 (Why is no real title available?)
- scientific article; zbMATH DE number 1116593 (Why is no real title available?)
This page was built for publication: The term generating power of context-free hypergraph grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037317)