scientific article
From MaRDI portal
Publication:4037292
zbMath0765.68091MaRDI QIDQ4037292
Grzegorz Rozenberg, Joost Engelfriet
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Monadic second-order definable graph transductions: a survey ⋮ Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ Logical description of context-free graph languages ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ A uniform approach to graph rewriting: The pullback approach ⋮ Dynamic labeled 2-structures with variable domains ⋮ A category-theoretical approach to vertex replacement: The generation of infinite graphs ⋮ Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence ⋮ Transformations of graph grammars ⋮ GETGRATS ⋮ Context-free hypergraph grammars with node rewriting ⋮ Finite graph automata for linear and boundary graph languages ⋮ Node rewriting in graphs and hypergraphs: A categorical framework ⋮ A Greibach normal form for context-free graph grammars ⋮ Unnamed Item ⋮ Generating irregular partitionable data structures ⋮ The monadic second-order logic of graphs. VIII: Orientations
This page was built for publication:
