In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.

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

The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.  

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...

Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...

This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution property (SP) partition for a finite intuitionistic fuzzy automaton is formulated, and the quotient automaton with respect to an SP partition is defined.

In this paper, we dene the concepts of compatibility between twofuzzy subsets on Q, the set of states of a max- min general fuzzy automatonand transitivity in a max-min general fuzzy automaton. We then construct auniform structure on Q, and dene a topology on it. We also dene the conceptof semi-uniform structures on a nonempty set X and construct a semi-uniformstructure on the set of states of ...