Finding frequent fuzzy itemsets in operational quantitative databases is a significant challenge for association rule mining the context of data mining. If are detected, decision-making process and formulating strategies businesses will be made more precise. Because characteristic these models large number transactions unlimited high-speed productions. This leads to limitations calculating supp...

Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification” of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper we are interested in the relationship between Boolean and fuzzy models and we analytically show, for the first time, the existence of a strong connection between them by foc...

It is proved that every uncountable !-bounded group and every homogeneous space containing a convergent sequence are resolvable. We nd some conditions for a topological group topology to be irresolvable and maximal.

This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution property (SP) partition for a finite intuitionistic fuzzy automaton is formulated, and the quotient automaton with respect to an SP partition is defined.

Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper, we are interested in the relationship between Boolean and fuzzy models and, for the first time, we analytically show the existence of a strong connection between them by fo...

We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity can’t be handled by usual searching algorithms. We present sample situations, which would use this kind of searching. Then we define a f...

[2] Karsten Lehmann and Rafael Peñaloza. The complexity of computing the behaviour of lattice automata on infinite trees. On the decidability status of fuzzy ALC with general concept inclusions. [4] Stefan Borgwardt and Rafael Peñaloza. Consistency reasoning in lattice-based fuzzy description logics. Context-dependent views to axioms and consequences of semantic web ontologies. Classifying soft...

In this paper, we introduce generalized directable fuzzy automaton and discuss their structural characterizations. We have shown that a generalized directable fuzzy automaton is an extension of a uniformly monogenically strongly directable fuzzy automaton by a uniformly monogenically trap-directable fuzzy automaton and obtain other equivalent conditions for a generalized directable fuzzy automa...