Skip to main content

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

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

Authors

Editor information

Editors and Affiliations

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