Geodesic
On Events Represented by Probabilistic Automata of Different Types
Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 242-251

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
Salomaa, Arto. On Events Represented by Probabilistic Automata of Different Types. Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 242-251. doi: 10.4153/CJM-1968-023-3
@article{10_4153_CJM_1968_023_3,
     author = {Salomaa, Arto},
     title = {On {Events} {Represented} by {Probabilistic} {Automata} of {Different} {Types}},
     journal = {Canadian journal of mathematics},
     pages = {242--251},
     year = {1968},
     volume = {20},
     number = {1},
     doi = {10.4153/CJM-1968-023-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-023-3/}
}
TY  - JOUR
AU  - Salomaa, Arto
TI  - On Events Represented by Probabilistic Automata of Different Types
JO  - Canadian journal of mathematics
PY  - 1968
SP  - 242
EP  - 251
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-023-3/
DO  - 10.4153/CJM-1968-023-3
ID  - 10_4153_CJM_1968_023_3
ER  - 
%0 Journal Article
%A Salomaa, Arto
%T On Events Represented by Probabilistic Automata of Different Types
%J Canadian journal of mathematics
%D 1968
%P 242-251
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-023-3/
%R 10.4153/CJM-1968-023-3
%F 10_4153_CJM_1968_023_3

[1] 1. Buharajev, R. G., Criteria for the representation 0} events infinite probabilistic automata, Dokl. Akad. Nauk SSSR, 164 (1965), 289–291 (in Russian). Google Scholar

[2] 2. Buharajev, R. G., Some equivalences in the theory of probabilistic automata, Verojatn. Metod. iKibernet. Ill , Kazan (1964), 45–65 (in Russian). Google Scholar

[3] 3. Ginsburg, S. and Rose, G. F., A characterization of machine mappings, Can. J. Math., 18 1966), 381–388. Google Scholar

[4] 4. Paz, A., Some aspects of probabilistic automata, Information and Control, 2 (1966), 26–60. Google Scholar

[5] 5. Rabin, M. O., Probabilistic automata, Information and Control, 6 (1963), 230–245. Google Scholar

Cité par Sources :