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

maji et al. introduced the concept of fuzzy soft sets as a generalization of the standard soft sets and presented an application of fuzzy soft sets in a decision making problem. in this paper, we apply fuzzy soft sets to  -hyperrings. the concept of ( , q )       -fuzzy soft  -hyperideals of  -hyperrings is first introduced. some new characterizations are investigated. in particular, a...

in this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. in particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. then we study fuzzy...

In this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. In particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. Then we study fuzzy...

As a measure of information shared between two fuzzy pattern vectors, the fuzzy information proximity measure (FIPM) plays an important part in fuzzy pattern recognition, fuzzy clustering analysis and fuzzy approximate reasoning. In this paper, two novel FIPMs are set up. Firstly, an axiom theory about the FIPM is given, and different expressions of the FIPM are discussed. A new FIPM is then pr...

During the last decade, CCS has been extended in diierent directions, among them priority and real time. One of the most satisfactory results for CCS is Milner's complete proof system for observational congruence 31]. Observational congruence is fair in the sense that it is possible to escape divergence, reeected by the axiom recX:(:X + P) = recX:::P. In this paper we discuss observational cong...

During the last decade, CCS has been extended in diier-ent directions, among them priority and real time. One of the most satisfactory results for CCS is Milner's complete proof system for observational congruence 28]. Observational congruence is fair in the sense that it is possible to escape divergence, reeected by an axiom recX:(:X + P) = recX:::P. In this paper we discuss observational cong...