Minimization of states in automata theory based on finite lattice-ordered monoids. (English) Zbl 1109.68058
Summary: We consider a concept of complete \(L\)-fuzzy matrix, define Complete Lattice-valued Finite Automata (CLFAs) and study their properties. The definitions of statewise equivalence relations and automata equivalence relations of a CLFA are given, two algorithms are aimed at the minimization of states of a CLFA.
Keywords:
lattice-ordered monoid; \(L\)-fuzzy matrix; fuzzy finite automata; equivalence; minimization algorithmReferences:
| [1] | Basak, N. C.; Gupta, A., On quotient machines of a fuzzy automata and the minimal machine, Fuzzy Sets and Systems, 125, 223-229 (2002) · Zbl 1015.68130 |
| [2] | Cheng, W.; Mo, Z. W., Minimization algorithm of fuzzy finite automata, Fuzzy Sets and Systems, 141, 439-448 (2004) · Zbl 1069.68563 |
| [3] | Gupta, M. M.; Saridis, G. N.; Gaines, B. R., Fuzzy Automata and Decision Processes (1977), North-Holland: North-Holland New York, pp. 111-175 · Zbl 0378.68035 |
| [4] | Lee, E. T.; Zadeh, L. A., Note on fuzzy languages, Information Sciences, 1, 421-434 (1969) |
| [5] | Li, Y. M., Finite automata with truth values in lattice-monoid and their languages, Journal of Shaanxi Normal University (Natural Science Edition), 4, 1-6 (2003) · Zbl 1088.68636 |
| [6] | Y.M. Li, W. Pedrycz, Regular expressions with truth values in lattice-moniod and their languages, in: 2004 Annual Meeting of The North American Fuzzy Information Processing Society, 2004 IEEE ISBN 0-7803-8377-X IEEE Cat. No. 04TH8736C, Banff, Alberta, Canada, June 27-30, 2004, pp. 572-577.; Y.M. Li, W. Pedrycz, Regular expressions with truth values in lattice-moniod and their languages, in: 2004 Annual Meeting of The North American Fuzzy Information Processing Society, 2004 IEEE ISBN 0-7803-8377-X IEEE Cat. No. 04TH8736C, Banff, Alberta, Canada, June 27-30, 2004, pp. 572-577. |
| [7] | Y.M. Li, Lattice-valued finite automata and their languages, in: 8th World Multiconference on Systematics, Cybernetics and Informatics (SCI2004), July 18-21, 2004, Orlando, FL, USA, pp. 213-218.; Y.M. Li, Lattice-valued finite automata and their languages, in: 8th World Multiconference on Systematics, Cybernetics and Informatics (SCI2004), July 18-21, 2004, Orlando, FL, USA, pp. 213-218. |
| [8] | Li, Y. M.; Pedrycz, W., Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoid, Fuzzy Sets and Systems, 156, 68-92 (2005) · Zbl 1083.68059 |
| [9] | Li, Y. M.; Pedrycz, W., The equivalence between fuzzy mealy and fuzzy moore machines, Soft Computing, 10, 953-959 (2006) · Zbl 1109.68059 |
| [10] | Li, Z. H.; Li, P.; Li, Y. M., The relationships among several types of fuzzy finite automata, Information Sciences, 176, 2208-2226 (2006) · Zbl 1110.68065 |
| [11] | Malik, D. S.; Mordeson, J. N.; Sen, M. K., Minimization of fuzzy finite automata, Information Sciences, 113, 323-330 (1999) · Zbl 0948.68110 |
| [12] | Malik, D. S.; Mordeson, J. N., Fuzzy Discrete Structures (2000), Physica-Verlag: Physica-Verlag New York · Zbl 0966.68098 |
| [13] | Mordeson, J. N.; Malik, D. S., Fuzzy Automata and Languages: Theory and Applications (2002), Chapman & Hall/CRC: Chapman & Hall/CRC Boca Raton, London · Zbl 1046.68068 |
| [14] | Omlin, C. W.; Thornber, K. K.; Giles, C. L., Fuzzy finite-state automata can be deterministically encoded in recurrent neural networks, IEEE Transactions on Fuzzy Systems, 5, 76-89 (1998) |
| [15] | Giles, C. L.; Omlin, C. W.; Thornber, K. K., Equivalence in knowledge representation: automata, recurrent neural networks, and dynamical fuzzy systems, Proceedings of IEEE, 87, 1623-1640 (1999) |
| [16] | Pedrycz, W.; Gacek, A., Learning of fuzzy automata, International Journal of Computational Intelligence and Applications, 1, 19-33 (2001) |
| [17] | Peeva, K., Behavior, reduction and minimization of finite \(L\)-automata, Fuzzy Sets and Systems, 28, 171-181 (1988) · Zbl 0663.68069 |
| [18] | Peeva, K., Equivalence, reduction and minimization of finite automata over semirings, Theoretical Computer Science, 88, 269-285 (1991) · Zbl 0737.68063 |
| [19] | Peeva, K., Finite \(L\)-fuzzy machines, Fuzzy Sets and Systems, 141, 415-437 (2004) · Zbl 1059.68066 |
| [20] | Qiu, D. W., Automata theory based on complete residuated lattice-valued logic, Science in China (Series F), 44, 419-429 (2001) · Zbl 1125.68383 |
| [21] | Qiu, D. W., Characterizations of fuzzy finite automata, Fuzzy Sets and Systems, 141, 391-414 (2004) · Zbl 1059.68069 |
| [22] | Qiu, D., Supervisory control of fuzzy discrete event systems: a formal approach, IEEE Transactions on Systems, Man and Cybernetics—Part B, 35, 72-88 (2005) |
| [23] | Ray, A. K.; Chatterjee, B.; Majumdar, A. K., A formal power series approach to the construction of minimal fuzzy automata, Information Sciences, 55, 189-207 (1991) · Zbl 0717.68059 |
| [24] | Topencharov, V.; Peeva, K., Equivalence, reduction and minimization of finite fuzzy automata, Journal of Mathematical Analysis and Applications, 84, 270-281 (1981) · Zbl 0477.68051 |
| [25] | W.G. Wee, On generalizations of adaptive algorithm and application of the fuzzy sets concept to pattern classification, Ph.D. Thesis, Purdue University, June 1967.; W.G. Wee, On generalizations of adaptive algorithm and application of the fuzzy sets concept to pattern classification, Ph.D. Thesis, Purdue University, June 1967. |
| [26] | Wee, W. G.; Fu, K. S., A formulation of fuzzy automata and its application as a model of learning systems, IEEE Transactions on Systems, Man and Cybernetics, 5, 215-223 (1969) · Zbl 0188.33203 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
