TY - GEN
T1 - Grammars controlled by special petri nets
AU - Dassow, Jürgen
AU - Turaev, Sherzod
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=67649933941&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67649933941&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-00982-2_28
DO - 10.1007/978-3-642-00982-2_28
M3 - Conference contribution
AN - SCOPUS:67649933941
SN - 9783642009815
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 326
EP - 337
BT - Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
T2 - 3rd International Conference on Language and Automata Theory and Applications, LATA 2009
Y2 - 2 April 2009 through 8 April 2009
ER -