|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
September 1970 (vol. 19 no. 9)
pp. 858
| ASCII Text | x | ||
| A. Paz, "R70-33 Fuzzy Events Realized by Finite Probabilistic Automata," IEEE Transactions on Computers, vol. 19, no. 9, pp. 858, September, 1970. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.223061, author = {A. Paz}, title = {R70-33 Fuzzy Events Realized by Finite Probabilistic Automata}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {9}, issn = {0018-9340}, year = {1970}, pages = {858}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.223061}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - R70-33 Fuzzy Events Realized by Finite Probabilistic Automata IS - 9 SN - 0018-9340 SP EP EPD - 858 A1 - A. Paz, PY - 1970 KW - null VL - 19 JA - IEEE Transactions on Computers ER - | |||
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.1Some 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); fT(x) =f(xT
Citation:
A. Paz, "R70-33 Fuzzy Events Realized by Finite Probabilistic Automata," IEEE Transactions on Computers, vol. 19, no. 9, pp. 858, Sept. 1970, doi:10.1109/T-C.1970.223061
Usage of this product signifies your acceptance of the Terms of Use.