Multiset pushdown automata. (English) Zbl 1191.68392
Summary: 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.
MSC:
68Q45 | Formal languages and automata |
68Q42 | Grammars and rewriting systems |
68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |