The Community for Technology Leaders
Green Image
Issue No. 09 - September (1970 vol. 19)
ISSN: 0018-9340
pp: 858
A. Paz , Technion
Let ? be a finite alphabet and ?* the set of all finite words (sequences of symbols) over ?. A fuzzy event f is a mapping from ?* into [0, 1] and is called probabilistic if it is induced by a probabilistic automaton.<sup>1</sup>Some operations are defined on fuzzy events f, g, r: for x??* (f ? g)(x) =Max (f(x), g(x)); (f ? g)(x)= min (f(x), g(x)); f(x)= 1-f(x); f<sup>T</sup>(x) =f(x<sup>T
A. Paz, "R70-33 Fuzzy Events Realized by Finite Probabilistic Automata", IEEE Transactions on Computers, vol. 19, no. , pp. 858, September 1970, doi:10.1109/T-C.1970.223061
79 ms
(Ver 3.3 (11022016))