Efficient Graph Rewriting and Its Implem
β
Heiko DΓΆrr (eds.)
π
Library
π
1995
π
Springer
π
English
β 2 MB
This book presents two major research results on the fast implementation of graph rewriting systems (GRS). First, it explores the class of so-called UBS-GRS, where the complexity of a rewriting step is linear instead of NP, showing for example that visual programming is possible by UBS graph rewriti