![]() |
Volumn 258, Issue 1-2, 2001, Pages 573-598
|
On the Petri net realization of context-free graphs
|
Author keywords
Graph grammars; Petri nets; Polyhedral cones; Regions; Semi linear sets
|
Indexed keywords
ALGORITHMS;
COMPUTABILITY AND DECIDABILITY;
CONTEXT FREE GRAMMARS;
THEOREM PROVING;
CONTEXT-FREE GRAPHS;
PETRI NETS;
|
EID: 0034915489
PISSN: 03043975
EISSN: None
Source Type: Journal
DOI: 10.1016/S0304-3975(00)00162-6 Document Type: Article |
Times cited : (5)
|
References (25)
|