scientific article; zbMATH DE number 17539

zbMATH Open0756.68070MaRDI QIDQ3974863FDOQ3974863

Authors: Joost Engelfriet 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Regular description of context-free graph languages
• Context-free hypergraph grammars with node rewriting
• Boundary graph grammars with dynamic edge relabeling
• Nonterminal bounded NLC graph grammars
• The generative power of context-free node rewriting in hypergraphs

zbMATH Keywords

graph grammarstree languagestring language

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (31)

• Graph automata for linear graph languages
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
• The generating power of total deterministic tree transducers
• Nondeterministic operations on finite relational structures
• Title not available (Why is that?)
• Monadic second-order definable graph transductions: a survey
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• A Greibach normal form for context-free graph grammars
• Title not available (Why is that?)
• Deterministic graph grammars
• The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
• Title not available (Why is that?)
• Title not available (Why is that?)
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Hypergraph languages of bounded degree
• Handle-rewriting hypergraph grammars
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Logical description of context-free graph languages
• Context-free hypergraph grammars with node rewriting
• Order independent NCE grammars recognized in polynomial time
• Title not available (Why is that?)
• NCE graph grammars and clique-width.
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• Graphs of grammars - derivations as parallel processes
• Maximum flows in parametric graph templates
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite graph automata for linear and boundary graph languages
• GETGRATS
• Generating irregular partitionable data structures
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974863)