Issue No. 09 - September (1970 vol. 19)
S. Hedetniemi , Dept. of Computer Sci. University of Iowa
A stationary maximin automaton is a system A = <S, U, f, h, F>, 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
S. Hedetniemi, "R70-36 Maximin Automata," in IEEE Transactions on Computers, vol. 19, no. , pp. 859, 1970.