Although the usefulness of fuzzy databases has been pointed out in several works, they are not fully developed in numerous domains. A task that is mostly disregarded and which is the topic of this paper is the determination of suitable inequalities for fuzzy sets in fuzzy query languages. This paper examines which kinds of fuzzy inequalities exist at all. Afterwards, different procedures are pr...

in this note first by considering the notion of general fuzzy automata (for simplicity gfa), we define the notions of direct product, restricted direct product and join of two gfa. also, we introduce some operations on (fuzzy) sets and then prove some related theorems. finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given gfa....

Bag context is a device for regulated rewriting in tree and string grammars. It represents context that is not part of the developing tree or string, but evolves on its own during a derivation. Motivation for investigating bag context tree languages is provided by showing that the class of bag context tree languages is the closure of the class of random context tree languages under linear top-d...

Fuzzy tree automata are mathematical devices for modeling and analyzing vaguely defined structures. The behavior of a fuzzy automaton generates language by mapping set regular trees on ranked alphabet to membership values. It calculates the grade using rules that process their structural characteristics. This paper deals with constructing models satisfies given logical propositions (called prop...

Expression and processing of vagueness, which has many real world applications, are not handled effectively in the conventional relational data model. In this paper we investigate a fuzzy extension to the relational data model and propose three fuzzy relational query languages. Two of them are the Level-1 Fuzzy Relational Algebra and Level-1 Fuzzy Relational Calculus. They are fundamental query...

In multidimensional datasets concurrent accesses to data via indexing structures introduce the problem protecting ranges specified in the retrieval from phantom insertions and deletions. This paper proposes a novel approach for concurrency in multidimensional datasets using Advanced Indexing Technique like generalized search tree, R tree and its variants, constitutes an efficient and sound conc...

Multidimensional scaling (MDS) is a data analysis technique for representing measurements of (dis)similarity among pairs of objects as distances between points in a low-dimensional space. MDS methods differ mainly according to the distance model used to scale the proximities. The most usual model is the Euclidean one, although a spherical model is often preferred to represent correlation measur...

Multidimensional Poverty Index (MPI) is a novel measure of poverty that is being used by United Nations Development Programme. The MPI is the answer to the call for a multidimensional view of poverty (Sen and Anand, 1997). It evaluates poverty at the individual level, with poor people being those who are deprived in multiple dimensions of well-being, and also the extent of poverty by assessing ...

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

The class of !-languages recognized by systolic tree automa-ta is introduced. That class extends the class of B uchi !-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on innnite sequences is decidable. A characterization of sys-tolic tree !-languages in terms of a (suitable) concatenation of ((nitary) systolic tree languages is also provided.