Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Zadeh (1972)
A Fuzzy-Set-Theoretic Interpretation of Linguistic Hedges, 2
E. Santos, W. Wee (1968)
General Formulation of Sequential MachinesInf. Control., 12
M. Mizumoto, J. Toyoda, Kokichi Tanaka (1975)
Various Kinds of Automata with WeightsJ. Comput. Syst. Sci., 10
M. Mizumoto, J. Toyoda, Kokichi Tanaka (1969)
Some Considerations on Fuzzy AutomataJ. Comput. Syst. Sci., 3
M. Mizumoto, J. Toyoda, Kokichi Tanaka (1973)
N-fold fuzzy grammarsInf. Sci., 5
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
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.