Equivalence between Mizumoto Lattice Finite Automata
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.
KeywordsLattice-ordered monoid Lattice finite automata Equivalence
Unable to display preview. Download preview PDF.
- 1.Lee, E.T., Zadeh, L.A.: Fuzzy languages and their acceptance by automata. In: Fourth Princeton Conference Information Science and Systems, p. 399 (1970)Google Scholar
- 2.Wechler, W., Dimitrov, V.: R-Fuzzy Automata. In: Proceedings of IFIP Congress on Information Processing 1974, Stockholm, Sweden, August 5-10, pp. 657–660. North-Holland, Amsterdam (1974)Google Scholar