On fuzzy recognizers

被引：11

作者：

Malik, DS ^{[1
]}

Mordeson, JN ^{[1
]}

机构：

[1] Creighton Univ, Dept Math & Comp Sci, Omaha, NE 68178 USA

来源：

KYBERNETES | 1999年 / 28卷 / 01期

关键词：

cybernetics; fuzzy sets; language;

D O I：

10.1108/03684929910253234

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we define and examine the concept of a fuzzy recognizer. If L(M) is the language recognized by M incomplete fuzzy recognizer M, zee show that there is a completion (M) over bar of M such that L((M) over bar) = L(M). We also show that if A is a recognizable set of words, then there is a complete accessible fuzzy recognizer M-A such that L(M-A) = A. We lay groundwork to determine rational decompositions of recognizable sets.

引用

页码：47 / 60

页数：14

共 7 条

[1]

Holcombe W .M. L., 1982, ALGEBRAIC AUTOMATA T

[2]

Kandel A., 1980, Fuzzy Switching and Automata Theory and Applications

[3]

Malik D. S., 1994, Advances in Fuzzy Theory and Technology, VII, P87

[4] Products of fuzzy finite state machines [J].

Malik, DS ;

Mordeson, JN ;

Sen, MK .

FUZZY SETS AND SYSTEMS, 1997, 92 (01) :95-102

[5]

WEE WG, 1967, THESIS PURDUE U W LA

[6] FUZZY SETS [J].

ZADEH, LA .

INFORMATION AND CONTROL, 1965, 8 (03) :338-&

[7]

Zadeh LA., 1965, P S SYST THEOR POL I, P29

← 1 →