FUZZY PROGRAMS AND THEIR EXECUTION
暂无分享,去创建一个
Publisher Summary This chapter discusses several methods that translate a given sequence of fuzzy instructions into another sequence of precise instructions called a machine program. A finite-state automaton is taken up as a fuzzy machine model that executes a fuzzy program. The chapter presents the formulation of an extended fuzzy machine based on a generalized automaton and a few procedures for execution of fuzzy programs. An L-fuzzy automaton with the weight space defined in the lattice ordered semigroup is considered as a general machine. Several machines are also derived from L-fuzzy automata as their specific examples. The chapter discusses a more general way of executing fuzzy programs by making use of the generalized fuzzy machine. The chapter presents a computer simulation of the process of human learning by making use of the concept of fuzzy program and learning algorithm.
[1] William G. Wee,et al. General Formulation of Sequential Machines , 1968, Inf. Control..
[2] Shi-Kuo Chang,et al. On the Execution of Fuzzy Programs Using Finite-State Machines , 1972, IEEE Transactions on Computers.
[3] Eugene S. Santos,et al. Maximin, minimax, and composite sequential machines , 1968 .
[4] Jun'ichi Toyoda,et al. Various Kinds of Automata with Weights , 1975, J. Comput. Syst. Sci..
[5] Lotfi A. Zadeh,et al. Quantitative fuzzy semantics , 1971, Inf. Sci..