Abstract
We introduce a minimal determinization procedure for fuzzy finite automata (FfAs) with membership values in a complete residuated lattice (CRL). The method is based on the well-known determinization method via factorization of fuzzy states. However, different to other determinization methods, we do not assume that the CRL is zero divisors free. This fact requires modifying the functions that define the factorization to avoid the zero divisor values when creating the fuzzy states in the determinization procedure. After generating a right-irreducible fuzzy deterministic finite automaton (FDfA) equivalent to the original FfA by determinization via factorization, we construct the so-called reduction graph of this fuzzy automaton, where each arc represents the notion that a fuzzy state is left-reducible by another fuzzy state. By making these left-reductions, we obtain the equivalent minimal FDfA. It is worth mentioning that an empty fuzzy state is always reducible by a nonempty fuzzy state. This behavior, specific for a CRL with zero divisors, has also to be taken into account when the state reduction is carried out.
S. Stanimirović acknowledges the support of the Science Fund of the Republic of Serbia, GRANT No. 7750185, Quantitative Automata Models: Fundamental Problems and Applications - QUAM, and the Ministry of Education, Science and Technological Development, Republic of Serbia, Contract No. 451-03-68/2022-14/200124.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bělohlávek, R.: Determinism and fuzzy automata. Inf. Sci. 143, 205–209 (2002)
Bělohlávek, R.: Fuzzy Relational Systems: Foundations and Principles. Kluwer, New York (2002)
Bělohlávek, R., Vychodil, V.: Fuzzy Equational Logic. Studies in Fuzziness and Soft Computing, Springer, Heidelberg (2005). https://doi.org/10.1007/b105121
Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical Theory of Automata. Volume 12 of MRI Symposia Series, pp. 529–561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y. (1962)
van Glabbeek, R., Ploeger, B.: Five determinisation algorithms. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 161–170. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70844-5_17
de Mendívil, J.R.G.: A generalization of Myhill-Nerode theorem for fuzzy languages. Fuzzy Sets Syst. 301, 103–115 (2016)
de Mendívil, J.R.G.: Conditions for minimal fuzzy deterministic finite automata via Brzozowski’s procedure. IEEE Trans. Fuzzy Syst. 26(4), 2409–2420 (2018)
de Mendívil, J.R.G., Figueredo, F.F.: Canonization of max-min fuzzy automata. Fuzzy Sets Syst. 376, 152–168 (2019)
de Mendívil, J.R.G., Garitagoitia, J.R.: Determinization of fuzzy automata via factorization of fuzzy states. Inf. Sci. 283, 165–179 (2014)
de Mendívil Grau, A.G., Stanimirović, S., Figueredo, F.F.: Minimal determinization procedure for fuzzy automata. techRxiv (2022). Preprint. https://doi.org/10.36227/techrxiv.21770510.v1
Hopcroft, J.E., Motwani, R., Ullman, J.: Introduction to Automata Theory, 3rd edn. Addison-Wesley (2007)
Ignjatović, J., Ćirić, M., Bogdanović, S.: Determinization of fuzzy automata with membership values in complete residuated lattices. Inf. Sci. 178, 164–180 (2008)
Jančić, Z., Ćirić, M.: Brzozowski type determinization for fuzzy automata. Fuzzy Sets Syst. 249, 73–82 (2014)
Micić, I., Jančić, Z., Ignjatović, J., Ćirić, M.: Determinization of fuzzy automata by means of the degrees of language inclusion. IEEE Trans. Fuzzy Syst. 23(6), 2144–2153 (2015)
Qiu, D.W.: Automata theory based on completed residuated lattice-valued logic (I). Sci. China Ser. F 44(6), 419–429 (2001). https://doi.org/10.1007/BF02713945
Qiu, D.W.: Automata theory based on completed residuated lattice-valued logic (ii). Sci. China Ser. F 45(6), 442–452 (2002). https://doi.org/10.1360/02yf9038
Stanimirović, S., Ćirić, M., Ignjatović, J.: Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders. Inf. Sci. 469, 79–100 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
de Mendívil Grau, A.G., Stanimirović, S., Fariña, F. (2023). Reduction Graph for Minimal Determinization of Fuzzy Automata. In: Massanet, S., Montes, S., Ruiz-Aguilera, D., González-Hidalgo, M. (eds) Fuzzy Logic and Technology, and Aggregation Operators. EUSFLAT AGOP 2023 2023. Lecture Notes in Computer Science, vol 14069. Springer, Cham. https://doi.org/10.1007/978-3-031-39965-7_45
Download citation
DOI: https://doi.org/10.1007/978-3-031-39965-7_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-39964-0
Online ISBN: 978-3-031-39965-7
eBook Packages: Computer ScienceComputer Science (R0)