1. Approximation Property of Fuzzy Finite Automata.
- Author
-
Kacprzyk, Janusz, Węgrzyn-Wolska, Katarzyna M., Szczepaniak, Piotr S., and Yongming Li
- Abstract
We have shown that nondeterministic fuzzy finite automata (or NFFAs, for short) and deterministic fuzzy finite automata (or DFFAs, for short) are not necessary to be equivalent in the previous work. We continue to study the approximation of fuzzy finite automata in this paper. In particular, we show that we can approximate an NFFA by some DFFA with any given accuracy even the NFFA is not equivalent to any DFFA, related construction is also presented. Some characterizations of NFFA and DFFA are given. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF