Determinism and fuzzy automata

被引：87

作者：

Belohlávek, R ^{[1
]}

机构：

[1] Palacky Univ, Dept Comp Sci, CR-77147 Olomouc, Czech Republic

[2] Univ Ostrava, Inst Res & Applicat Fuzzy Modeling, Ostrava, Czech Republic

来源：

INFORMATION SCIENCES | 2002年 / 143卷 / 1-4期

关键词：

automata; fuzzy sets; fuzzy automata; deterministic automata;

D O I：

10.1016/S0020-0255(02)00192-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The concept of a fuzzy automaton, as studied in the literature, is a direct generalization of the classical concept of a non-deterministic automaton. In this paper, we consider the question of whether there is a deterministic counterpart to the notion of a fuzzy automaton. We propose a definition of deterministic fuzzy automata and show that they are equally powerful as fuzzy automata. Compared to the classical notion of a deterministic automaton, the deterministic fuzzy automaton defined in our paper differs essentially only in that the final states form a fuzzy set. Moreover, we show that deterministic fuzzy automata are equally powerful as nested systems of deterministic automata. (C) 2002 Elsevier Science Inc. All rights reserved.

引用

页码：205 / 209

页数：5