Bibliografía

Multiset Pushdown Automata

Manfred Kudlek, Patrick Totzke, and Georg Zetzsche.
Multiset pushdown automata.
Fundamenta Informaticae, 93(1-3):221-233, 2009.

Resumen: Multiset finite Automata, a model equivalent to regular commutative grammars, are extended with a multiset store and the accepting power of this extended model of computation is investigated. This type of multiset automata come in two flavours, varying only in the ability of testing the storage for emptiness. This paper establishes normal forms and relates the derived language classes to each other as well as to known multiset language classes.

BibTeX registro

@ARTICLE{Kudlek+09,
     AUTHOR   = {Kudlek, Manfred and Totzke, Patrick and Zetzsche, Georg},
     TITLE    = {Multiset Pushdown Automata},
     YEAR     = 2009,
     JOURNAL  = {Fundamenta Informaticae},
     VOLUME   = 93,
     NUMBER   = {1-3},
     PAGES    = {221--233},
     ABSTRACT = {Multiset finite Automata, a model equivalent to
   regular commutative grammars, are extended with a
   multiset store and the accepting power of this
   extended model of computation is investigated. This
   type of multiset automata come in two flavours,
   varying only in the ability of testing the storage
   for emptiness. This paper establishes normal forms
   and relates the derived language classes to each
   other as well as to known multiset language classes.}
}

Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.