Some notes to minimization of multiset finite automata

The paper deals with minimization of multiset finite automata. It is shown that in case of deterministic multiset finite automata whose transitions satisfy certain conditions based on lexicographic ordering, the resulting minimal automaton is unique up to isomorphism. On the other hand, no such unique minimal automaton exists in case of nondeterministic multiset finite automata.