Abstract
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.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Properties of Bounded-Addition Fuzzy Semi-simple Splicing Systems;Proceedings of the International Conference on Mathematical Sciences and Statistics 2022 (ICMSS 2022);2022-12-06
2. Interval type-2 fuzzy automata and Interval type-2 fuzzy grammar;Journal of Applied Mathematics and Computing;2021-06-16
3. A Theory of Approximate Reasoning with Type-2 Fuzzy Set;Journal of the Indonesian Mathematical Society;2021-03-31
4. Fuzzy automata and languages: theory and applications;Fuzzy Sets and Systems;2004-06
5. Vagueness and Blurry Sets;Journal of Philosophical Logic;2004-04