Each fuzzy set can be represented by a nested system of ordinary sets—its a-cuts. There is an extensive literature on fuzzy sets devoted to problems of the following kind: is it possible to reduce operations with fuzzy sets to operations with their a-cuts? Is it possible to reduce properties of fuzzy relations to properties of their a-cuts? More generally, can a fuzzy concept be represented by ...

We show by standard automated theorem proving methods and freely available automated theorem prover software that axiom (A2), stating that multiplicative conjunction implies its first member, is provable from other axioms in fuzzy logics BL and MTL without using axiom (A3), which is known to be provable from other axioms [1]. We also use freely available automated model generation software to s...

The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...

Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, andbackward-forwardbisimulations) between fuzzyautomatahavebeen introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of th...