A definition of finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states is proposed. Acceptance of intuitionistic fuzzy regular language by the finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states are examined. It is found that the finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states is more suitable for recognizing intuitionistic fuzzy regular language than earlier model. The paper also gives an idea of intuitionistic fuzzy regular expressions through possible definitions.