scientific article; zbMATH DE number 522845
From MaRDI portal
Publication:4284239
zbMATH Open0793.68115MaRDI QIDQ4284239FDOQ4284239
Authors: Bruno Courcelle 
Publication date: 17 April 1994
Title of this publication is not available (Why is that?)
Recommendations
- Structural properties of context-free sets of graphs generated by vertex replacement
- Context-free graph languages of bounded degree are generated by apex graph grammars
- scientific article; zbMATH DE number 522836
- scientific article; zbMATH DE number 809155
- The generative power of context-free node rewriting in hypergraphs
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Cited In (13)
- Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
- A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
- Structural properties of context-free sets of graphs generated by vertex replacement
- Title not available (Why is that?)
- Deterministic graph grammars
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Characteristics of graph languages generated by edge replacement
- Context-free hypergraph grammars with node rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 Q4284239)
