Name
Abstract | ||
|---|---|---|
A Petri net controlled grammar is a context-free grammar with a control by a Petri net whose transitions are labeled with rules of the grammar or the empty string and the associated language consists of all terminal strings which can be derived in the grammar and the sequence of rules in a derivation is in the image of a successful occurrence of transitions of the net. We present some results on the generative capacities of such grammars that Petri nets are restricted to some known structural subclasses of Petri nets. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-00982-2_28 | LATA |
Keywords | Field | DocType |
context-free grammar,associated language,petri net,generative capacity,special petri nets,controlled grammar,terminal string,structural subclasses,successful occurrence,empty string,context free grammar | Tree-adjoining grammar,Context-sensitive grammar,Petri net,Context-free grammar,Programming language,Controlled grammar,Computer science,Stochastic Petri net,Adaptive grammar,Mildly context-sensitive grammar formalism | Conference |
Volume | ISSN | Citations |
5457 | 0302-9743 | 4 |
PageRank | References | Authors |
0.95 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Dassow | 1 | 530 | 118.27 |
| Sherzod Turaev | 2 | 31 | 10.81 |