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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dassow, J., Turaev, S.: Arbitrary petri net controlled grammars. In: Enguix, G., Jiménez-López, M. (eds.) The Second International Workshop on Non-classical Formal Languages in Linguistics, Forling 2008, Tarragona, Spain, pp. 27–39 (2008)
Dassow, J.: Subregularly controlled derivations: Context-free case. Rostock. Math. Kolloq. 34, 61–70 (1988)
Dassow, J., Truthe, B.: Subregularly tree controlled grammars and languages. In: Csuhaj-Varjú, E., Esik, Z. (eds.) The 12th Inernational Conference AFL 2008, Balatonfured, Hungary, pp. 158–169 (2008)
Baumgarten, B.: Petri-Netze. Grundlagen und Anwendungen. Wissensschaftverlag, Mannheim (1990)
Desel, J., Esparsa, J.: Free-Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol. 10. Cambridge University Press, Cambridge (1995)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. I–III. Springer, Berlin (1996)
Reisig, W., Rozenberg, G. (eds.):Lectures on Petri Nets I: Basic Models. LNCS, vol. 1491. Springer, Heidelberg (1998)
Dassow, J., Pǎun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Turaev, S.: Semi-matrix grammars. In: The Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2006, Mikulov, Czech Republic, pp. 245–252 (2006)
Graham, R., Lovász, M.G. (eds.): Handbook of Combinatorics, vol. I–II. Elsevier(North-Holland), Amsterdam and MIT Press, Cambridge (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dassow, J., Turaev, S. (2009). Grammars Controlled by Special Petri Nets. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-00982-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00981-5
Online ISBN: 978-3-642-00982-2
eBook Packages: Computer ScienceComputer Science (R0)