Related papers: Implication-Based Intuitionistic Fuzzy Finite Stat…
This paper explores the integration of hypothetical reasoning into an efficient implementation of the fuzzy logic language Bousi~Prolog. To this end, we first analyse what would be expected from a logic inference system, equipped with what…
Strategy of intelligent cognitive control systems based on quantum and soft computing presented. Quantum self-organization knowledge base synergetic effect extracted from intelligent fuzzy controllers imperfect knowledge bases described.…
Fuzzy automata have long been accepted as a generalization of nondeterministic finite automata. A closer examination, however, shows that the fundamental property---nondeterminism---in nondeterministic finite automata has not been well…
In this paper the concept of Q-fuzzification of ideals of gamma-semigroups has been introduced and some important properties have been investigated. A characterization of regular gamma-semigroup in terms of Q-fuzzy ideals has been obtained.…
Intuitionistic fuzzy relations on finite universes can be represent by intuitionistic fuzzy matrices and the limiting behavior of the power matrices depends on the algebraic operation employed on the matrices. In this paper, the power of…
A deterministic finite-state automaton (FSA) is an abstract sequential machine that reads the symbols comprising an input word one at a time. An FSA is symmetric if its output is independent of the order in which the input symbols are read,…
To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There…
In this paper, a new method based on TOPSIS and optimization models is proposed for multi-attribute group decision-making in the environment of interval-valued intuitionistic fuzzy sets.Firstly, by minimizing the sum of differences between…
The notion of Intuitionistic fuzzy hypervector space has been generalized and a few basic properties on this concept are studied. It has been shown that the intersection and union of an arbitrary family of Intuitionistic fuzzy hypervector…
An important constraint of Fuzzy Inference Systems (FIS) is their structured rules defined based on evaluating all input variables. Indeed, the length of all fuzzy rules and the number of input variables are equal. However, in many…
This paper introduces a new algorithm for the induction if complex finite state automata from samples of behavior. The algorithm is based on information theoretic principles. The algorithm reduces the search space by many orders of…
In this paper we analyse the benefits of incorporating interval-valued fuzzy sets into the Bousi-Prolog system. A syntax, declarative semantics and im- plementation for this extension is presented and formalised. We show, by using potential…
Fuzzy discrete event systems as a generalization of (crisp) discrete event systems have been introduced in order that it is possible to effectively represent uncertainty, imprecision, and vagueness arising from the dynamic of systems. A…
L.A.Zadeh introduced the concept of fuzzy set theory as the generalization of classical set theory in 1965 and further it has been generalized to intuitionistic fuzzy sets (IFSs) by Atanassov in 1983 to model information by the membership,…
Simulations and bisimulations are well-established notions in crisp/fuzzy automata theory and are widely used to compare the behaviors of automata. Their main drawback is that they compare the behaviors of fuzzy automata in a crisp manner.…
We introduced and study fuzzy gamma-hypersemigroups, according to fuzzy semihyper- groups as previously defined [33] and prove that results in this respect. In this regard first we introduce fuzzy hyperoperation and then study fuzzy…
Imitation learning frameworks for robotic manipulation have drawn attention in the recent development of language model grounded robotics. However, the success of the frameworks largely depends on the coverage of the demonstration cases:…
The transformation of a nondeterministic finite-state automaton into a deterministic finite-state automaton is an integral part of any course on formal languages and automata theory. For some students, understanding this transformation is…
The main objective of this paper is to develop a new semantic Network structure, based on the fuzzy sets theory, used in Artificial Intelligent system in order to provide effective on-line assistance to users of new technological systems.…
Dead Reckoning mechanisms are usually used to estimate the position of simulated entity in virtual environment. However, this technique often ignores available contextual information that may be influential to the state of an entity,…