Grammars controlled by petri nets with inhibitor arcs
DOI:
https://doi.org/10.11113/mjfas.v6n2.190Keywords:
Formal grammars and languages, Grammars with regulated rewriting, Petri nets, Petri net controlled grammars,Abstract
A Petri net controlled grammar is a grammar equipped with a Petri net whose transitions are labeled with production rules of the grammar, and the associated language consists of all terminal strings which can be derived in the grammar and 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 this paper we define grammars controlled by Petri nets with inhibitor arcs and investigate their computational capacities.
References
J. Dassow and S. Turaev, LNCS 5196 (2008) 209-220.
J. Dassow and S. Turaev, LNCS 5457 (2009) 326-337.
J. Dassow and S. Turaev, J. of Universal Computer Science, 15(14) (2009) 2808-2835.
J. Dassow and S. Turaev, Romanian J. of Information Science and Technology, 12(2) (2009) 191–207.
J. Dassow and Gh. Paun, Springer, Berlin, 1989.
G. Rozenberg and A. Salomaa, Springer, 1997.
M.H. Selamat and S. Turaev, ICCRD 2010 (2010) 51-55.
R. Stiebe and S. Turaev, EPTCS, 3 (2009) 193-203.
S. Turaev, MEMICS 2007 (2007) 233-240.
S. Turaev, PhD Thesis, 2010.
G. Zetzsche, DLT 2009, (2009) 490-501.
