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. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Dassow, J., & Turaev, S. (2009). Grammars controlled by special petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5457, pp. 326–337). https://doi.org/10.1007/978-3-642-00982-2_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
