In this paper, an attempt has been made to prove the analogue of Myhill Nerode Theorem for fuzzy automata. Though as in finite automata case, it does not help us in minimizing the number of states in a fuzzy automaton, nevertheless it contains very interesting results.
Monoid, Non deterministic automaton, equivalence class, fuzzy regular language, fuzzy automaton