Repository | Series | Book | Chapter
Equivalence between mizumoto lattice finite automata
pp. 33-37
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.
Publication details
Published in:
Cao Bing-yuan, Zhang Cheng-yi, Li Tai-fu (2009) Fuzzy information and Engineering I. Dordrecht, Springer.
Pages: 33-37
DOI: 10.1007/978-3-540-88914-4_5
Full citation:
Wang Yang, Mo Zhi-wen (2009) „Equivalence between mizumoto lattice finite automata“, In: B. Cao, C. Zhang & T.-f. Li (eds.), Fuzzy information and Engineering I, Dordrecht, Springer, 33–37.