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.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 th...

Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...

In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finall...

The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...

In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...

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 min...

in this note, we introduce the concept of a fuzzy filter of a blalgebra,with respect to a t-norm briefly, t-fuzzy filters, and give some relatedresults. in particular, we prove representation theorem in bl-algebras. thenwe generalize the notion of a fuzzy congruence (in a bl-algebra) was definedby lianzhen et al. to a new fuzzy congruence, specially with respect to a tnorm.we prove that there i...

In this note, we introduce the concept of a fuzzy filter of a BLalgebra,with respect to a t-norm briefly, T-fuzzy filters, and give some relatedresults. In particular, we prove Representation Theorem in BL-algebras. Thenwe generalize the notion of a fuzzy congruence (in a BL-algebra) was definedby Lianzhen et al. to a new fuzzy congruence, specially with respect to a tnorm.We prove that there i...

The aim of this paper is to introduce the notion of anti fuzzy (prime) deductive system in BL-algebra and to investigate their properties. It is shown that the set of all deductive systems (with the empty set) of a BL-algebra X is equipotent to a quotient of the set of all anti fuzzy deductive systems of X. The anti fuzzy prime deductive system theorem of BL-algebras is also proved. Anti Fuzzy ...