TY - GEN
T1 - Grammars controlled by Petri nets with place capacities
AU - Selamat, Mohd Hasan
AU - Turaev, Sherzod
PY - 2010
Y1 - 2010
N2 - A Petri net controlled grammar is a grammar equipped with a Petri net whose transitions are labeled with production rules and nonterminals of the grammar, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is enabled at the initial marking and finished at a final marking of the net. In the paper we investigate the generative power of grammars controlled by Petri nets with place capacities.
AB - A Petri net controlled grammar is a grammar equipped with a Petri net whose transitions are labeled with production rules and nonterminals of the grammar, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is enabled at the initial marking and finished at a final marking of the net. In the paper we investigate the generative power of grammars controlled by Petri nets with place capacities.
KW - Formal languages and grammars
KW - Grammars with regulated rewriting
KW - Petri net controlled grammars
KW - Petri nets
UR - http://www.scopus.com/inward/record.url?scp=77955193485&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955193485&partnerID=8YFLogxK
U2 - 10.1109/ICCRD.2010.43
DO - 10.1109/ICCRD.2010.43
M3 - Conference contribution
AN - SCOPUS:77955193485
SN - 9780769540436
T3 - 2nd International Conference on Computer Research and Development, ICCRD 2010
SP - 51
EP - 55
BT - 2nd International Conference on Computer Research and Development, ICCRD 2010
T2 - 2nd International Conference on Computer Research and Development, ICCRD 2010
Y2 - 7 May 2010 through 10 May 2010
ER -