Semirings, automata, languages
Semirings, automata, languages
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Automata, Languages, and Machines
Automata, Languages, and Machines
Membrane Computing: An Introduction
Membrane Computing: An Introduction
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Category Theory and Computer Science
P machines: an automata approach to membrane computing
WMC'06 Proceedings of the 7th international conference on Membrane Computing
| Hi-index | 0.00 |
We introduce and study a new class of automata able to consume and produce multisets; we call them Mealy multiset automata. We are interested in their algebraic and coalgebraic properties. After some useful properties of multisets, we present the notions of bisimulation, observability, and behavior for Mealy multiset automata. We give a characterization of the bisimulation between two Mealy multiset automata, and a result relating their general behavior to their sequential behavior. We describe an endofunctor of the category of Set such that a Mealy multiset automaton is a coalgebra of this functor. This functor preserves coproducts, coequalizers, and weak pullbacks. Moreover, the new defined bisimulation is an instance of a more general coalgebraic definition.