Multiset Pushdown Automata

Authors:
Manfred Kudlek;Patrick Totzke;Georg Zetzsche
Affiliations:
Department Informatik, MIN Fakultät Universität Hamburg Vogt-Kölln-Straße 30, D-22527 Hamburg, Germany. {kudlek,3totzke,3zetzsch}@informatik.uni-hamburg.de;Department Informatik, MIN Fakultät Universität Hamburg Vogt-Kölln-Straße 30, D-22527 Hamburg, Germany. {kudlek,3totzke,3zetzsch}@informatik.uni-hamburg.de;(Correspd.) Department Informatik, MIN Fakultät Universität Hamburg Vogt-Kölln-Straße 30, D-22527 Hamburg, Germany. {kudlek,3totzke,3zetzsch}@informatik.uni-hamburg.de
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2009

Citing 4
Cited 0

On Context-Free Languages

Journal of the ACM (JACM)
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Multiset Automata

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Closure Properties of Multiset Language Families

Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)

Quantified Score

Hi-index	0.00

Visualization

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.