Simulations and bisimulations between two fuzzy automata over a complete residuated lattice were defined by Ćirić et al. (2012) [7], [8] as relations the sets of states automata. However, they act crisp relationship In particular, if there exists (forward) bisimulation automata, then languages recognized them are crisply equal. Approximate simulations introduced Stanimirović (2022) [36] aim at ...

In this work we propose an approach to encode real objects represented by feature vectors into fuzzy concepts. A system is designed, whose main component is an adaptive fuzzy encoder which learns object membership degrees to fuzzy concepts from a set of objects and the expert’s crisp assignment to a concept. To properly use the expert’s crisp choices, the learning is performed with the help of ...

Fuzzy Description Logics (DLs) generalize crisp ones by providing membership degree semantics for concepts and roles. A popular technique for reasoning in fuzzy DL ontologies is by providing a reduction to crisp DLs and then employ reasoning in the crisp DL. In this paper we adopt this approach to solve conjunctive query (CQ) answering problems for fuzzy DLs. We give reductions for Gödel, and Ł...

The present paper concerns with the characteristic semigroup of input independent and state independent fuzzy automaton. Apart from the relationship between input independent and state independent fuzzy automaton, various properties of characteristic semigroups of state independent fuzzy automaton are established. Also, quasi-perfect fuzzy automaton and quasi strongly connected fuzzy automaton ...

Pattern matching problem is still very interesting and important problem. Algorithms for the exact pattern matching search for exact patterns in some texts or figures. Algorithms for an approximate pattern matching search for exact and similar patterns with some errors. They use some measures to evaluate a similarity of found similar patterns. In the area of the pattern matching allowing errors...

In this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (DMUs) in stochastic data envelopment analysis (DEA) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. It is shown that this deterministic model can be converted to a quadratic programming model. So fa...

Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68–92] have proved fundamental results that provide different equivalentways to represent fuzzy languageswithmembership values in a lattice-orderedmonoid, and generalize the well-known results of the classical theory of fo...

The paper presents a transition from the crisp rough set theory to a fuzzy one, called Alpha Rough Set Theory or, in short, a-RST. All basic concepts or rough set theory are extended, i.e., information system, indiscernibility, dependency, reduction, core, de®nability, approximations and boundary. The resulted theory takes into account fuzzy data and allows the approximation of fuzzy concepts. ...

Assignment problem (AP) is a well known topic and is used very often in solving problems of engineering and management science. In this problem aij denotes the cost for assigning the jth job to the ith person. The cost is usually deterministic in nature. In this paper ãij has been considered to be trapezoidal and triangular numbers denoted by ãij which are more realistic and general in nature. ...