Javascript must be enabled to continue!

FUZZY‐FUZZY AUTOMATA

Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L. A. Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are investigated. It is shown that fuzzy‐fuzzy languages characterized by fuzzy‐fuzzy automata are closed under the operations of union, intersection, concatenation, and Kleene closure in the sense of fuzzy sets of type 2, but are not closed under complement. The power of fuzzy‐fuzzy automata as an acceptor is the same as that of ordinary fuzzy automata and finite automata, though fuzzy‐fuzzy automata include fuzzy automata and finite automata as special cases. Finally, fuzzy‐fuzzy grammars are illustrated and it is shown that fuzzy‐fuzzy grammars with context‐free rules can generate context‐sensitive languages.

Emerald

M. MIZUMOTO K. TANAKA

Kybernetes

2008

Title: FUZZY‐FUZZY AUTOMATA

Description:

Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L.

Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are investigated.

It is shown that fuzzy‐fuzzy languages characterized by fuzzy‐fuzzy automata are closed under the operations of union, intersection, concatenation, and Kleene closure in the sense of fuzzy sets of type 2, but are not closed under complement.

The power of fuzzy‐fuzzy automata as an acceptor is the same as that of ordinary fuzzy automata and finite automata, though fuzzy‐fuzzy automata include fuzzy automata and finite automata as special cases.

Finally, fuzzy‐fuzzy grammars are illustrated and it is shown that fuzzy‐fuzzy grammars with context‐free rules can generate context‐sensitive languages.

Back

Abstract The equivalence of different forms of automata provides a lot of convenience for us to solve practical problems. Sometimes, for efficient use of a fuzzy finite aut...

Simulations for Event-Clock Automata

Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically usef...

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation

AbstractIn this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, history and future, that can express many timed features succinctly, includ...

Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson

Abstract. Fuzzy Inference System requires several stages to get the output, 1) formation of fuzzy sets, 2) formation of rules, 3) application of implication functions, 4) compositi...

Generated Fuzzy Quasi-ideals in Ternary Semigroups

Here in this paper, we provide characterizations of fuzzy quasi-ideal in terms of level and strong level subsets. Along with it, we provide expression for the generated fuzzy quasi...

Permutation Groups in Automata Diagrams

Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types o...

ω – SUBSEMIRING FUZZY

Mapping ρ is called a fuzzy subset of an empty set of S if ρ is the mapping from S to the closed interval [0,1]. A fuzzy subset ρ introduced into this paper is a fuzzy subset of se...

New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings

Background Several scholars defined the concepts of fuzzy soft set theory and their application on decision-making problem. Based on this concept, researchers defined the generalis...

Email:
Password:

Email:

FUZZY‐FUZZY AUTOMATA

Related Results