The string generating power of context-free hypergraph grammars
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 177442
- scientific article; zbMATH DE number 4041305
- String Generating Hypergraph Grammars with Word Order Restrictions
- The generative power of context-free node rewriting in hypergraphs
- Graph Transformations
- Context-free grammars, generating functions and combinatorial arrays
- Powerful and NP-complete: hypergraph Lambek grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- scientific article; zbMATH DE number 177438
- Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
Cites work
- scientific article; zbMATH DE number 3808978 (Why is no real title available?)
- scientific article; zbMATH DE number 3823169 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4035184 (Why is no real title available?)
- scientific article; zbMATH DE number 4041305 (Why is no real title available?)
- scientific article; zbMATH DE number 4049099 (Why is no real title available?)
- scientific article; zbMATH DE number 4049150 (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 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 4114059 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Absolutely parallel grammars and two-way finite-state transducers
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Graph expressions and graph rewritings
- Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
- 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
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Linear and Context-Free Graph Grammars
- Linear graph grammars: Power and complexity
- One way finite visit automata
- Passes and paths of attribute grammars
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Translations on a context free grammar
- Tree transducers, L systems, and two-way machines
Cited in
(24)- The monadic second-order logic of graphs. VII: Graphs as relational structures
- Second-order abstract categorial grammars as hyperedge replacement grammars
- The generating power of total deterministic tree transducers
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Multiple context-free tree grammars: lexicalization and characterization
- Concatenation of graphs
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- Monadic second-order definable graph transductions: a survey
- A Greibach normal form for context-free graph grammars
- scientific article; zbMATH DE number 177442 (Why is no real title available?)
- scientific article; zbMATH DE number 39880 (Why is no real title available?)
- scientific article; zbMATH DE number 7456062 (Why is no real title available?)
- On the power of local graph expansion grammars with and without additional restrictions
- Hypergraph languages of bounded degree
- Handle-rewriting hypergraph grammars
- 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
- The translation power of top-down tree-to-graph transducers
- The Pumping Lemma for Well-Nested Multiple Context-Free Languages
- Independent parallelism in finite copying parallel rewriting systems
- Graph Transformations
This page was built for publication: The string 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 Q1176107)
