in this paper, we deal with molaei’s generalized groups. we definethe notion of a fuzzy generalized subgroup with respect to a t-norm (ort-fuzzy generalized subgroup) and give some related properties. especially,we state and prove the representation theorem for these fuzzy generalizedsubgroups. next, using the concept of continuity of t-norms we obtain a correspondencebetween tf(g), the set of ...

The aim of this paper is to introduce the notions of interval valued (∈,∈ ∨q)-fuzzy Boolean (implicative, positive implicative and fantastic) filters in BL-algebras and to investigate some related properties. Some characterizations of these generalized fuzzy filters are derived. Finally, the relations among these generalized fuzzy filters are discussed. It is proved that an interval valued (∈,∈...

The paper studies the relationship among fuzzy context free languages and fuzzy push down automata. The degree of membership of the words to the fuzzy language generated by a context free grammar, calculated in a monoid, introduces an additional burden for the accepting push down weighted automaton. Even in the case of languages accepted by fuzzy deterministic push down automata, the relationsh...

In this study, some (fuzzy) filters of a Sheffer stroke BL-algebra and its properties are presented. To show relationship between filter fuzzy BL-algebra, we prove that f is (ultra) C if only fp either empty or for each p ∈ [0, 1], it satisfied = f(1) the characteristic function nonempty subset BL-algebra.

First we show that the cosets of a fuzzy ideal μ in a BCK-algebraX form another BCK-algebra  X/μ (called the fuzzy quotient BCK-algebra of X by μ). Also we show thatX/μ is a fuzzy partition of X and we prove several some isomorphism theorems. Moreover we prove that if the associated fuzzy similarity relation of a fuzzy partition P of a commutative BCK-algebra iscompatible, then P is a fuzzy quo...

In this paper, we extend the notion of tree language quotients to bottom-up quotients. Instead of computing the residual of a tree language from top to bottom and producing a list of tree languages, we show how to compute a set of k-ary trees, where k is an arbitrary integer. We define the quotient formula for different combinations of tree languages: union, symbol products, compositions, itera...

A language L is prefix-closed if w ∈ L implies that every prefix of w is in L. It is known that a regular language is prefix-closed if and only if it is accepted by a nondeterministic finite automaton (NFA) with all states final [18]. In the minimal incomplete deterministic finite automaton (DFA) for a prefix-closed language, all the states are final as well. The authors of [18] examined severa...

In the application of fuzzy reasoning, researchers usually choose the membership function optionally in some degree. Even though the membership functions may be different for the same concept, they can generally get the same or approximate results. The robustness of the membership function optionally chosen has brought many researchers’ attention. At present, many researchers pay attention to t...

In this paper we study and equationally characterize the subvarieties of BL, the variety of BL-algebras, which are generated by families of single-component BL-chains, i.e. MV-chains, Product-chain or Gödel-chains. Moreover, it is proved that they form a segment of the lattice of subvarieties of BL which is bounded by the Boolean variety and the variety generated by all single-component chains,...