Ranjeet Kaur
Department of Mathematics, Jaypee Institute of Information Technology, Noida, Uttar Pradesh, India. ABES Engineering College, Ghaziabad, Uttar Pradesh, India.

Alka Tripathi
Department of Mathematics, Jaypee Institute of Information Technology, Noida, Uttar Pradesh, India.

DOI https://doi.org/10.33889/IJMEMS.2021.6.6.101

  ;

Abstract

The minimization of automaton is important to reduce space and computational time. Reduction in number of states and transitions leads to equivalent automaton with less number of states and transitions. In this paper, state minimization of General Finite Fuzzy Automata (GFFA) is discussed. To obtain minimal equivalent GFFA we have removed redundant states and transitions using substitution property (SP) partition and quotient machine. The algorithm to find membership values of states of the GFFA is described and algorithm to associate states with quotient machine to obtain minimal machine with less number of states is discussed.

Keywords- General fuzzy automata, Minimal automata, Quotient machine, Substitution property partition.

Citation

Kaur, R., & Tripathi, A. (2021). State Minimization of General Finite Fuzzy Automata. International Journal of Mathematical, Engineering and Management Sciences, 6(6), 1709-1728. https://doi.org/10.33889/IJMEMS.2021.6.6.101.