Skip to main content
Springer Nature Link
Log in

Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages

  • Conference paper
  • First Online:
Multiset Processing (WMC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2235))

Included in the following conference series:

Abstract

We investigate closure properties of multiset languages, de- fined by multiset grammars. To this aim, this abstract families of multiset languages are considered, as well as several normal forms for multiset grammars. Furthermore, a new definition of deterministic finite multiset automata is proposed.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. E. Csuhaj-Varjú, C. Martín Vide, V. Mitrana, Multiset automata, in this volume.

    Google Scholar 

  2. S. Ginsburg, The Mathematical Theory of Context-free Languages, McGraw Hill,1966.

    Google Scholar 

  3. M. Kudlek, Rational, Linear and Algebraic Languages of Multisets, Pre-Proceedings of the Workshop on Multiset Processing (WMP’2000), C. S. Calude, M. J. Dinneen, G. Păun, eds., CDMTCS-140, 2000, 138–148.

    Google Scholar 

  4. M. Kudlek, C. Martín Vide, Gh. Păun, Toward FMT (Formal Macroset Theory),Pre-Proceedings of the Workshop on Multiset Processing (WMP’2000), C. S. Calude, M. J. Dinneen, G. Păun, eds., CDMTCS-140, 2000, 149–158.

    Google Scholar 

  5. Gh. Păun, Computing with Membranes. An Introduction, Bulletin of EATCS, 67(1999), 139–152.

    MATH  Google Scholar 

  6. A. Salomaa, Formal Languages, Academic Press, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Hamburg

    Manfred Kudlek

  2. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

Authors
  1. Manfred Kudlek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Mitrana
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science Center for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland

    Cristian S. Calude

  2. Institute of Mathematics of the Romanian Academy, Romanian

    Gheorghe PĂun

  3. Leiden Institute for Advanced Computer Science, Leiden University, Leiden

    Grzegorz Rozenberg

  4. Turku Center for Computer Science, TUCS, Turku

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kudlek, M., Mitrana, V. (2001). Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages. In: Calude, C.S., PĂun, G., Rozenberg, G., Salomaa, A. (eds) Multiset Processing. WMC 2000. Lecture Notes in Computer Science, vol 2235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45523-X_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45523-X_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43063-6

  • Online ISBN: 978-3-540-45523-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics