Minimization For Two Types Of Finite State Automata

This article gives the concepts of intuitionistic allowed relation, Congruence,homomorphism and isomorphism relations on intuitionistic fuzzy finite state automata.This paper also gives the minimization through equivalent states dividing of the statesset. Besides this article defines synchronous lattice-valued intuitionistic fuzzy finiteautomata and complete synchronous lattice-valued intuitionistic fuzzy finite automata.In the end, this chapter finds the minimization method through the relation of itsbehavior matrix and the states dividing.