In this paper, we investigate more relations between the symmetric residuated lattices $L$ with their corresponding intuitionistic fuzzy residuated lattice $tilde{L}$. It is shown that some algebraic structures of $L$ such as Heyting algebra, Glivenko residuated lattice and strict residuated lattice are preserved for $tilde{L}$. Examples are given for those structures that do not remain the sam...

Algebraic properties and structures of intuitionistic $$L-$$ fuzzy multiset finite automata (ILFMA) are discussed through congruences on a semigroup in this paper. Firstly, we put forward the notion compatible relation, monoid associated with relation can be effectively constructed, construct two monoids different congruence relations given ILFMA, then prove that they isomorphic. Furthermore, u...

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 is a study about the relationships among topologies and intuitionistic fuzzy topology induced, respectively, by approximation operators and an intuitionistic fuzzy approximation operator associated with an approximation space (X,R), when the relation R on X is precisely reflexive and transitive. In particular, we consider an intuitionistic fuzzy approximation operator on an approxima...

The aim of this paper is to study the concept of Intuitionistic L-fuzzy subrings and Intuitionistic L-fuzzy ideals of a ring R. In this direction definitions and properties relating to Intuitionistic L-fuzzy subrings of R and Intuitionistic L-fuzzy ideals of R are introduced and discussed. We introduce a special type of Quotient ring.

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.

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. The sets of provable formulas in corresponding inference systems from the point of view of uncertain information can be described by fuzzy filters of those algebraic semantics. Bounded residuated lattice ordered monoids (R`-monoids) are a common generalization of pseudo ...

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