Title :
State minimization of fuzzy automaton
Author_Institution :
Dept. of Math. & Sci. Educ., Nat. Taipei Teachers Coll., Taiwan
Abstract :
A finite automaton consists of a finite set of states and a set of transitions from state to state that occur on input symbols. When the states of a finite automaton are characterized by fuzzy sets, the outputs and transitions are facilitated by appropriate relation, then this finite automaton is called a fuzzy automaton. Two states of fuzzy automaton have similarity relation as they have the similar degree from itself to the final state for any arbitrary input symbol. Based on the clustering technique, we present an algorithm to minimize the states of fuzzy automaton
Keywords :
automata theory; fuzzy set theory; minimisation; clustering; fuzzy automaton; fuzzy set theory; input symbols; similarity relation; state minimization; Automata; Clustering algorithms; Educational institutions; Erbium; Fuzzy set theory; Fuzzy sets; Mathematics; Tin;
Conference_Titel :
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7803-4778-1
DOI :
10.1109/ICSMC.1998.728181
