Context Free Hypergraph Grammars: Node and Hyperedge Rewriting with an Application to Petri Nets
- ISBN-10
- 3831126747
- ISBN-13
- 9783831126743
- Pages
- 170
- Language
- English
- Published
- 2002-01
- Publisher
- BoD – Books on Demand
- Author
- Renate Klempien-Hinrichs
Description
Lemma 4.22 states that the sets Red(X) can be computed in time 0(2
