A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Directable Fuzzy Automata
2015
International Journal of Computer Applications
Preserved Fulltext
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