scientific article
From MaRDI portal
Publication:3673131
zbMath0522.68071MaRDI QIDQ3673131
Hans-Joerg Kreowski, Annegret Habel
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fixed-point theoremgraph grammarscontext-free graph languagesedge replacement systemsnode replacement systemsrecursive transition networks
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Characteristics of graph languages generated by edge replacement ⋮ Metatheorems for decision problems on hyperedge replacement graph languages ⋮ Graph-theoretic properties compatible with graph derivations ⋮ Edge-label controlled graph grammars ⋮ Lyndon trees
This page was built for publication: