Abstract
In this paper, we study the minimization of lattice-valued multiset finite automata with membership values in a distributive lattice. First, we establish the equivalence of (nondeterministic) lattice multiset finite automata (LMA) and deterministic lattice multiset finite automata (DLMA). Furthermore, we present some operations on lattice-valued regular multiset languages, and prove that the family of lattice-valued regular multiset languages is closed under this operations. We also introduce and study the minimal DLMAs and present an effective algorithm to obtain a minimal DLMA for a given LMA. Finally, we give a decomposition of lattice-valued regular multiset language by some simple lattice-valued regular multiset languages accepted by some special minimal DLMAs.
Keywords
Get full access to this article
View all access options for this article.
