Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

FUZZYFUZZY AUTOMATA

FUZZYFUZZY AUTOMATA Based on the concept of fuzzy sets of type 2 or fuzzyfuzzy sets defined by L. A. Zadeh, fuzzyfuzzy automata ate newly formulated and some properties of these automata are investigated. It is shown that fuzzyfuzzy languages characterized by fuzzyfuzzy 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 fuzzyfuzzy automata as an acceptor is the same as that of ordinary fuzzy automata and finite automata, though fuzzyfuzzy automata include fuzzy automata and finite automata as special cases. Finally, fuzzyfuzzy grammars are illustrated and it is shown that fuzzyfuzzy grammars with contextfree rules can generate contextsensitive languages. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Kybernetes Emerald Publishing

FUZZYFUZZY AUTOMATA

Kybernetes , Volume 5 (2): 6 – Feb 1, 1976

Loading next page...
 
/lp/emerald-publishing/fuzzyfuzzy-automata-bBQW5qXU4c

References (8)

Publisher
Emerald Publishing
Copyright
Copyright © Emerald Group Publishing Limited
ISSN
0368-492X
DOI
10.1108/eb005415
Publisher site
See Article on Publisher Site

Abstract

Based on the concept of fuzzy sets of type 2 or fuzzyfuzzy sets defined by L. A. Zadeh, fuzzyfuzzy automata ate newly formulated and some properties of these automata are investigated. It is shown that fuzzyfuzzy languages characterized by fuzzyfuzzy 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 fuzzyfuzzy automata as an acceptor is the same as that of ordinary fuzzy automata and finite automata, though fuzzyfuzzy automata include fuzzy automata and finite automata as special cases. Finally, fuzzyfuzzy grammars are illustrated and it is shown that fuzzyfuzzy grammars with contextfree rules can generate contextsensitive languages.

Journal

KybernetesEmerald Publishing

Published: Feb 1, 1976

There are no references for this article.