deterministic automata

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a minimal BLGLFA. After that, we show that for any given finite realization β, the minimal complete deterministic BL-GLFA recognizing β is isomorphic to any complete accessible deterministic reduced BL-GLFA recognizing β. Moreover, we give some examples to clarify these notions. Finally, by using these notions, we give some theorems and algorithms and obtain some related results.