en عمومى General پژوهشي Research paper &nbsp; <div style="text-align: justify;"><span class="fontstyle0">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 </span><span class="fontstyle2">&beta;</span><span class="fontstyle0">, there exists a minimal complete deterministic BL-GLFA recognizing </span><span class="fontstyle2">&beta;</span><span class="fontstyle0">. We prove any complete deterministic accessible reduced BL-GLFA is a minimal BLGLFA. After that, we show that for any given finite realization </span><span class="fontstyle2">&beta;</span><span class="fontstyle0">, the minimal complete deterministic BL-GLFA recognizing </span><span class="fontstyle2">&beta; </span><span class="fontstyle0">is isomorphic to any complete accessible deterministic reduced BL-GLFA recognizing </span><span class="fontstyle2">&beta;</span><span class="fontstyle0">. 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.</span></div> BL-general fuzzy automata, Minimal automata, Reduction, Deterministic automata. 131 144 http://ijmsi.ir/browse.php?a_code=A-10-2248-2&slc_lang=en&sid=1 Marzieh Shamsizadeh shamsizadeh.m@gmail.com 100319475328460010022 100319475328460010022 Yes Department of Mathematics, Behbahan Khatam Alanbia University of Technology, Behbahan, Iran Mohammad Mehdi Zahedi zahedi_mm@kgut.ac.ir 100319475328460010023 100319475328460010023 No Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran Khadijeh Abolpour abolpor_kh@yahoo.com 100319475328460010024 100319475328460010024 No Department of Mathematics, Shiraz Branch, Islamic Azad University, Shiraz, Iran