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

  • Manfred Kudlek
  • Victor Mitrana
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2235)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Csuhaj-Varjú, C. Martín Vide, V. Mitrana, Multiset automata, in this volume.Google Scholar
  2. 2.
    S. Ginsburg, The Mathematical Theory of Context-free Languages, McGraw Hill,1966.Google Scholar
  3. 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. 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. 5.
    Gh. Păun, Computing with Membranes. An Introduction, Bulletin of EATCS, 67(1999), 139–152.MATHGoogle Scholar
  6. 6.
    A. Salomaa, Formal Languages, Academic Press, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Manfred Kudlek
    • 1
  • Victor Mitrana
    • 2
  1. 1.Fachbereich InformatikUniversität HamburgHamburg
  2. 2.Faculty of MathematicsUniversity of BucharestBucharestRomania

Personalised recommendations