Abstract
We study the relationships between fuzzy Mealy and fuzzy Moore machines in the frame of truth values in a lattice-ordered monoid. In particular, we show that lattice-valued sequential-like machines and lattice-valued finite Moore machines are equivalent in the sense they exhibit the same input–output characteristics.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Basak NC, Gupta A (2002) On quotient machines of a fuzzy automata and the minimal machine. Fuzzy Sets Syst 125:223–229
Birkhoff G (1973) Lattice theory (1940), 3rd edn. American Mathematical Society, Providence, Rhode Island
Booth TL (1967) Sequential machines and automata theory. John Wiley, New York
Cheng W, Mo ZW (2004) Minimization algorithm of fuzzy finite automata. Fuzzy Sets Syst 141:439–448
Grätzer G (1978) General lattice theory. Academic, New York
Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages and computation. Addison-Wesley, New York
Kandel A, Lee SC (1980) Fuzzy switching and automata: theory and applications. Arnold, London
Li YM, Li ZH (1999) Quantales and the process semantics of bisimulation. Acta Math Sinica 42(2):313–320 (in Chinese)
Li YM (2001) Dual quantales and their properties, J. Shaanxi Normal University (Natural Science edn), 29(1):1–5 (in Chinese)
Li YM (2001) Noncommutative linear logic and its quantale semantics, J. Shaanxi Normal University (Natural Science Edn), 29(12):1–5 (in Chinese)
Li YM, Zhou M, Li ZH (2002) Projective objects and injective objects in the category of quantales. J Pure Appl Alg 176(2–3):249–258
Li YM, Shi ZK (2000) Remarks on uninorm aggregation operators. Fuzzy Sets Syst 114(3):377–380
Malik DS, Mordeson JN, Sen MK, Minimization of fuzzy finite automata. Inf Sci 113:323–330
Malik DS, Mordeson JN (2000) Fuzzy discrete structures. Physica-Verlag, New York
Mordeson JN, Malik DS (2002) Fuzzy automata and languages: theory and applications. Chapman & Hall/CRC, Boca Raton
Močkoř J (2002) Semigroup homomorphisms and fuzzy automata. Soft Comput 6:423–427
Paz A (1971) Introduction to probabilistic automata. Academic, New York
Pedrycz W, Gacek A (2001) Learning of fuzzy automata. Inter J Comput Intell Appl 1(1):19–33
Peeva K (1991) Equivalence, reduction and minimization of finite automata over semirings. Theor Comput Sci 88:269–285
Peeva K (2004) Finite L-fuzzy machines. Fuzzy Sets Syst 141(3):415–437
Rosenthal KL (1990) Quantales and their applications. Longman, London
Santos ES (1968) Maximin automata. Inf Control 12:367–377
Santos ES (1972) Max-product machines. J Math Anal Appl 37:677–686
Santos ES (1972) On reduction of max-min machines. J Math Anal Appl 40:60–78
Santos ES, Wee WG (1968) General formulation of sequential machines. Inf Control 12(1):5–10
Starke P (1998) Abstract automata, 2nd edn. Birkhaeuser, Basel
Topencharov V, Peeva K (1981) Equivalence, reduction and minimization of finite fuzzy automata. J Math Anal Appl 84:270–281
Wee WG (1967) On generalizations of adaptive algorithm and application of the fuzzy sets concept to pattern classification, PhD Thesis, Purdue University
Wee WG, Fu KS (1969) A formulation of fuzzy automata and its application as a model of learning systems. IEEE Trans Syst Man Cybern 5:215–223
Yager RR (1994) Aggregation operators and fuzzy systems modeling. Fuzzy Sets Syst 67:129–145
Ying MS (2002) A formal model of computing with words. IEEE Trans Fuzzy Syst 10(5):640–652
Zadeh LA (1971) Fuzzy languages and their relation to human and machine intelligence. Electronic Research Laboratory, University of California, Berkeley. Tech.Rep.ERL-M302
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, Y., Pedrycz, W. The equivalence between fuzzy Mealy and fuzzy Moore machines. Soft Comput 10, 953–959 (2006). https://doi.org/10.1007/s00500-005-0022-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-005-0022-x