Abstract
An abstract model for the execution of fuzzy programs using finite-state machines is described, Different ways of executing fuzzy programs are investigated. It is shown that the performance function λ of a fuzzy machine M can be effectively constructed so that the program searching cost of an elementary fuzzy program, a number of elementary fuzzy programs, or a regular fuzzy program is minimized. Some application examples are discussed.

This publication has 20 references indexed in Scilit: