Intuitionistic general fuzzy automata

In this paper, by considering the notions of general fuzzy automata, admissible relation, admissible partition and intuitionistic fuzzy set based on the Atanassov (Fuzzy Sets Syst 20(1):87–96, 1986), we define the concepts intuitionistic general fuzzy automaton (IGFA), max–min intuitionistic general fuzzy automaton, admissible relation for the IGFA, admissible partition for the IGFA, quotient IGFA and language for an IGFA. In particular, a connection between the admissible partition and the quotient IGFA is presented and it is shown that any quotient of a given IGFA and the IGFA itself has the same language. Also, using the above notions, some related theorems are proved and, finally, some examples are given to clarify these new notions.