Skip to main content
SpringerLink
Log in

k-Petri Net Controlled Grammars

  • Conference paper
Language and Automata Theory and Applications (LATA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5196))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Dassow, J., Pǎun, G.: Regulated rewriting in formal language theory. Springer, Berlin (1989)

    Google Scholar 

  5. Hack, M.: Petri net languages. Computation Structures Group Memo 124, p. 128. MIT, Cambridge (1975)

    Google Scholar 

  6. Hauschildt, D., Jantzen, M.: Petri nets algorithms in the theory of matrix grammars. Acta Informatica 31, 719–728 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Longman Publishing Co., Inc, Amsterdam (1990)

    Google Scholar 

  8. Reisig, W., Rozenberg, G. (eds.): Lectures on Petri nets I: Basic models. LNCS, vol. 1491. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  9. Turaev, S.: Petri Net Controlled Grammars. In: Proc. 3rd Doctoral Workshop on MEMICS-2007, Znojmo, Czech Republic, pp. 233–240 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Otto-von-Guericke-Universität Magdeburg, PSF 4120, D-39016, Magdeburg, Germany

    Jürgen Dassow

  2. GRLMC, Universitat Rovira i Virgili, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Sherzod Turaev

Authors
  1. Jürgen Dassow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sherzod Turaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation