scientific article
From MaRDI portal
Publication:3673132
zbMath0522.68072MaRDI QIDQ3673132
Dirk Janssens, Grzegorz Rozenberg
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Graph theoretic closure properties of the family of boundary NLC graph languages ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ A uniform approach to graph rewriting: The pullback approach ⋮ A structural/temporal query language for business processes ⋮ Results of NLC grammars with one-letter terminal alphabets ⋮ A category-theoretical approach to vertex replacement: The generation of infinite graphs ⋮ Node rewriting in graphs and hypergraphs: A categorical framework ⋮ Linear graph grammars: Power and complexity ⋮ Generating irregular partitionable data structures ⋮ Graphical reasoning in compact closed categories for quantum computation
This page was built for publication:
