On Events Represented by Probabilistic Automata of Different Types

The usual definition of a finite probabilistic automaton (4; 5) does not involve any outputs. In this paper, such automata are referred to as Rabin automata. Various other types of probabilistic automata are obtained by introducing output functions. Similarly, as in connection with finite deterministic automata, the distinction between Moore automata and Mealy automata can then be made. Rabin automata may be regarded as automata where the output function is deterministic. One can also consider the case where the transition function is deterministic.