Properties of Multiset Language Classes Defined by Multiset Pushdown Automata

Authors:
Manfred Kudlek;Patrick Totzke;Georg Zetzsche
Affiliations:
(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;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
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2009

Citing 6
Cited 2

Petri net algorithms in the theory of matrix grammars

Acta Informatica
Closure properties of multiset language families

Fundamenta Informaticae - Membrane computing
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
PETRI NET LANGUAGE

PETRI NET LANGUAGE
Multiset Pushdown Automata

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Reaction automata

Theoretical Computer Science
On the properties of language classes defined by bounded reaction automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The previously introduced multiset language classes defined by multiset pushdown automata are being explored with respect to their closure properties and alternative characterizations.