Open AccessState Minimization of General Finite Fuzzy Automata
Author(s) -
Ranjeet Kaur,
Alka Tripathi
Publication year - 2021
Publication title -
international journal of mathematical, engineering and management sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.228
H-Index - 10
ISSN - 2455-7749
DOI - 10.33889/ijmems.2021.6.6.101
Subject(s) - quotient , automaton , finite state machine , minification , mathematics , quantum finite automata , dfa minimization , substitution (logic) , fuzzy logic , reduction (mathematics) , discrete mathematics , algorithm , computer science , automata theory , combinatorics , theoretical computer science , mathematical optimization , artificial intelligence , geometry , programming language
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.