Abstract
We introduce a new type of regulated grammars using Petri nets as a control of the derivations of a context-free grammar. We investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars.
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
ter Beek, M.H., Kleijn, H.C.M.: Petri net control for grammar systems. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 220–243. Springer, Heidelberg (2002)
Ceska, M., Marek, V.: Petri nets and random-context grammars. In: Proc. 35th Spring Conference: Modeling and Simulation of Systems (MOSIS 2001), MARQ Ostrava Hardec nad Moravici, pp. 145–152 (2001)
Crespi-Reghizzi, S., Mandrioli, D.: Petri nets and commutative grammars. Internal Report No. 74-5, Laboratorio di Calcolatori, Instituto de Elettrotecnica ed Elettronica del Politecnico di Milano, Italy (1974)
Dassow, J., Pǎun, G.: Regulated rewriting in formal language theory. Springer, Berlin (1989)
Hack, M.: Petri net languages. Computation Structures Group Memo 124, p. 128. MIT, Cambridge (1975)
Hauschildt, D., Jantzen, M.: Petri nets algorithms in the theory of matrix grammars. Acta Informatica 31, 719–728 (1994)
Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Longman Publishing Co., Inc, Amsterdam (1990)
Reisig, W., Rozenberg, G. (eds.): Lectures on Petri nets I: Basic models. LNCS, vol. 1491. Springer, Heidelberg (1998)
Turaev, S.: Petri Net Controlled Grammars. In: Proc. 3rd Doctoral Workshop on MEMICS-2007, Znojmo, Czech Republic, pp. 233–240 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dassow, J., Turaev, S. (2008). k-Petri Net Controlled Grammars. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-88282-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88281-7
Online ISBN: 978-3-540-88282-4
eBook Packages: Computer ScienceComputer Science (R0)