1Department of Computer Science and Engineering, RNSIT, Bangalore-560061, Karnataka, India.
2Department of Information Science and Engineering, B I E T, Davangere - 577 004, Karnataka, India.
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