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.
Kybernetes – Emerald Publishing
Published: Feb 1, 1976
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera