Bisimulation for BL-general fuzzy automata

Abstract

In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.<br />For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and this quotient is minimal, furthermore there is a morphism from the first one to its quotient.<br />Also, for two given BL-general fuzzy automata we present an algorithm, which determines bisimulation between them.<br />Finally, we present some examples to clarify these new notions.