Abstract
The present paper studies so-called R-fuzzy recursive program schemes which are finitely specified by systems of equations x i = p i , i = 1,…, n. Thereby, X = { x 1,…, x n } is a finite set of variables and the p i 's are polynomials built up over X unioned wih a finite set F of function symbols and with coefficients in a given semiring R that determines the different kind of fuzziness by evaluating possible choices. Using power series on F-tree with variables of X the meaning of R-fuzzy recursive program schemes can formally be computed. The main result shows the equivalence of equational (fixed point) and operational semantics of such program schemes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
