in this paper we present a method for solving fuzzy linear systemsby two crisp linear systems. also necessary and sufficient conditions for existenceof solution are given. some numerical examples illustrate the efficiencyof the method.

We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivation-controlled iteration grammar. Under minor assumptions on the family of control languages and on the family of fuzzy languages in the underlying iteration grammar, we show that (i) regular c...

Vagueness and high dimensional space data are usual features of current data. The paper is an approach to identify conceptual structures among fuzzy three dimensional data sets in order to get conceptual hierarchy. We propose a fuzzy extension of the Galois connections that allows to demonstrate an isomorphism theorem between fuzzy sets closures which is the basis for generating lattices ordere...

The concepts of fuzzy source and fuzzy successor operators for an L-fuzzy automaton (L is a latticeordered monoid) are introduced, which turn out to be L-fuzzy closure operators. When L is a quantale, these operators introduce L-fuzzy topologies. These observations are then used to give topological characterization of the separatedness and connectedness properties of an L-fuzzy automaton. c ©20...

In this paper, we present a general framework for the study of interval type-2 rough fuzzy sets by using both constructive and axiomatic approaches. First, several concepts and properties of interval type-2 fuzzy sets are introduced. Then, a pair of lower and upper interval type-2 rough fuzzy approximation operators with respect to a crisp binary relation is proposed. Classical representations ...

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

In 2004, G. Ganesan and C. Raghavendra Rao introduced the concept of Rough Fuzzy Groups. In this paper, we have adapted this approach in defining the algebraic closure of a given fuzzy graph using each vertex.

In this paper we introduce the notion of interval valued hesitant fuzzy soft topological space. Also the concepts of interval valued hesitant fuzzy soft closure; interior and neighbourhood are introduced here and established some important results.