In this paper, the concept of hypergraph is extended to the fuzzy hypergraph. In the fuzzy hypergraph, the concepts of a-cut hypergraph, strength of edge and dual fuzzy hypergraph are developed. It is shown that the fuzzy hypergraph and a-cut hypergraph are useful to represent a fuzzy partition. An application example also shows that the strength of edge can be used to decompose the data set in...

According to fuzzy arithmetic, general dual fuzzy linear system (GDFLS) cannot be replaced by a fuzzy linear system (FLS). In this paper, we use new notation of fuzzy numbers and convert a GDFLS to two linear systems in crisp case, then we discuss complexity of the proposed method. Conditions for the existence of a unique fuzzy solution to n× n GDFLS are derived. AMS Subject Classification: 34K...

In this paper intuitionistic fuzzy pushdown automata, acceptance by empty stack and acceptance by final states and their equivalence is proved. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent. We propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs), intuitionistic fuzzy languages generated by IFCFGs. Additionally, we introd...

Many fuzzy automaton models have been introduced in the past. Here, we discuss two basic nite fuzzy automaton models, the Mealy and Moore types, for lexical analysis. We show that there is a remarkable di erence between the two types. We consider that the latter is a suitable model for implementing lexical analysers. Various properties of fuzzy regular languages are reviewed and studied. A fuzz...

The -rst attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when this notion was introduced by Zadeh. Recently, it has been observed that corresponding so-called classical fuzzy Turing machines can solve undecidable problems. In this paper we will give exact recursion-theoretical characterization of the computational power of ...

In fuzzy propositional logic, to a proposition a partial truth in [0; 1] is assigned. It is well known that under certain circumstances, fuzzy logic collapses to classical logic. In this paper, we will show that under dual conditions, fuzzy logic collapses to four-valued (relevance) logic, where propositions have truth-value true,false, unknown, or contradiction. As a consequence, fuzzy entailm...

The lack of double negation and de Morgan properties makes fuzzy logic unsymmetrical. This is the reason why fuzzy versions of notions like closure operator or Galois connection deserve attention for both antiotone and isotone cases, since they are not dual. This paper offers them attention, comming to the following conclusions: some kind of hardly describable ”local preduality” still makes pos...

Dual-mode fuzzy dynamic matrix control (fuzzy DMC-FDMC) algorithms with guaranteed nominal stability for constrained nonlinear plants are presented. The algorithms join the advantages of fuzzy Takagi-Sugeno modeling and the predictive dual-mode approach in a computationally efficient version. Thus, they can bring an improvement in control quality compared with predictive controllers based on li...