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. 859
S. Hedetniemi, Dept. of Computer Sci. University of Iowa
A stationary maximin automaton is a system A = , where S and U are finite nonempty sets of states and inputs, respectively; F?S is a set of final states; f:S ? U ? S ?[0, 1] can be imagined to be a transition relation which associates with every state s E S and input u E U a measure, 0= f(s,u,s') = 1 that the next state is s', there being no constraint, for example, that th
Citation:
S. Hedetniemi, "R70-36 Maximin Automata," IEEE Transactions on Computers, vol. 19, no. 9, pp. 859, Sept. 1970, doi:10.1109/T-C.1970.223064
Usage of this product signifies your acceptance of the Terms of Use.