Equivalence between Mizumoto Lattice Finite Automata

  • Yang Wang
  • Zhi-wen Mo
Conference paper
Part of the Advances in Soft Computing book series (AINSC, volume 54)


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.


Lattice-ordered monoid Lattice finite automata Equivalence 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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
  3. 3.
    Li, Y.M., Pedrycz, W.: Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids. Fuzzy Sets and Systems 156, 68–92 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Cheng, W., Mo, Z.W.: Minimization algorithm of fuzzy finite automata. Fuzzy Sets and Systems 141, 439–448 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Mo, Z.W., Hong, X.L.: Minimization of Mizumoto Automata. Fuzzy Information and Engineering (ICFIE), ASC 40, 739–743 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Yang Wang
    • 1
  • Zhi-wen Mo
    • 1
  1. 1.College of Mathematics and Software ScienceSichuan Normal UniversityP.R. China

Personalised recommendations