Minimization of general L-fuzzy automata

In this note, by considering the notions of intuitionistic general L-fuzzy automata based on lattice valued intuitionistic fuzzy sets and (α, β)-language, we prove that for any (α,β)-language L, there exists a minimal IGLFA recognizing L.