Equivalence between mizumoto lattice finite automata

Yang Wang

Zhi-wen Mo

pp. 33-37

in: Bing-yuan Cao, Cheng-yi Zhang, Tai-fu Li (eds), Fuzzy information and Engineering I, Berlin, Springer, 2009

Abstract

We use lattice-ordered monoids in the study of Mizumoto lattice finite automata. In this paper, we give the definition of its matrix presentation and establish the statewise equivalence relations of Mizumoto lattice finite automata originally. Moreover, the automata equivalence relations are obtained and two algorithms deciding the equivalence between Mizumoto lattice finite automata are constructed.