Directable Fuzzy Automata

V. Karthikeyan, M. Rajasekar
2015 International Journal of Computer Applications  
The aim of this paper is testing the directability of a given fuzzy automaton. A fuzzy automaton is directable if there exists a word, a directing word, which takes each state of a fuzzy automaton to a single state with some membership value. In this paper, we proposed a method for testing the directability of a fuzzy automaton using the mergeability relation.
doi:10.5120/ijca2015906119 fatcat:3n62n6zgafbqfdnntwqsdrpz44