Properties of Multiset Language Classes Defined by Multiset Pushdown Automata

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

[1]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

[2]  Matthias Jantzen,et al.  Petri net algorithms in the theory of matrix grammars , 2005, Acta Informatica.

[3]  Manfred Kudlek,et al.  Multiset Pushdown Automata , 2009, Fundam. Informaticae.

[4]  Manfred Kudlek,et al.  Toward a Formal Macroset Theory , 2000, WMP.

[5]  M. Schützenberger,et al.  Rational sets in commutative monoids , 1969 .

[6]  Victor Mitrana,et al.  Closure Properties of Multiset Language Families , 2002, Fundam. Informaticae.

[7]  Matthias Jantzen,et al.  On the hierarchy of Petri net languages , 1979, RAIRO Theor. Informatics Appl..