In this paper we introduce the smallest equivalence relation ξ∗ on a finite fuzzy hypergroup S such that the quotient group S/ξ∗, the set of all equivalence classes, is a solvable group. The characterization of solvable groups via strongly regular relation is investigated and several results on the topic are presented.

Bonin et al. (1993) recalled an open problem related to the recurrence relation verified by NSW numbers. The recurrence relation is the following: fn+l = 6f~ f~l , with jq = 1 and j~ = 7, and no combinatorial interpretation seems to be known. In this note, we define a regular language .~ whose number of words having length n is equal to f~+l. Then, by using .La we give a direct combinatorial pr...

We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...

‎a new method for the defuzzification of fuzzy numbers is developed in this paper. it is well-known, defuzzification methods allow us to find aggregative crisp numbers or crisp set for fuzzy numbers. but different fuzzy numbers are often converted into one crisp number. in this case the loss of essential information is possible. it may result in inadequate final conclusions, for example, expert...

in a recent paper, de baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. in this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. the reasoninglargely ...

in this paper we have generalized the concepts of ,q-fuzzy ideals, ,q-fuzzy quasi-ideals and,q-fuzzy bi-ideals by introducing the concepts of   k ,q -fuzzy ideals,   k ,q -fuzzy quasiideals and   k ,q -fuzzy bi-ideals in ternary semigroups and several related properties are investigated. different characterizations of regular and weakly regular ternary semigroups b...

This paper introduce two types of edge degrees (line degree and near line degree) total (total an in a fuzzy semigraph, where semigraph is defined as (V, σ, μ, η) on G* which σ : V → [0, 1], μ VxV 1] η X satisfy the conditions that for all vertices u, v vertex set, μ(u, v) ≤ σ(u) ᴧ σ(v) η(e) = μ(u1, u2) μ(u2, u3) … μ(un-1, un) σ(u1) σ(un), if e (u1, u2, …, un), n ≥ 2 G*, pair sets X) set non - ...

In this paper, we first use a fuzzy preference relation with a membership function representing preference degree forcomparing two interval-valued fuzzy numbers and then utilize a relative preference relation improved from the fuzzypreference relation to rank a set of interval-valued fuzzy numbers. Since the fuzzy preference relation is a total orderingrelation that satisfies reciprocal and tra...

The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...

We give a new version of fuzzy alternating Büchi automata over distributive lattices: weights are putting in every leaf node of run trees rather than along with edges from every node to its children. Such settings are great benefit to obtain complement just by taking dual operation and replacing each final weight with its complement. We prove that L-fuzzy nondeterministic Büchi automata have th...