Abstract
Presents fundamental results on fuzzy Mealy machines. Unlike the classical Mealy machine which requires two functions, one to describe the next state and another to describe the output, a fuzzy Mealy machine requires only one fuzzy function to characterize completely the next state and the output produced. Apart from the obvious generalization that can be obtained from corresponding results on fuzzy finite state machines by introduction of an output associated with each transition, introduces the concept of an interval partition of [0, 1] and uses it to obtain more general results.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference7 articles.
1. Wee, W.G. "On generalizations of adaptive algorithm and application of fuzzy sets concepts to pattern classification", PhD thesis,Purdue University, West Lafayette, LA, June 1967.
2. Fuzzy Switching and Automata
3. Algebraic Automata Theory
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献