Hostname: page-component-77c89778f8-vpsfw Total loading time: 0 Render date: 2024-07-22T13:40:25.421Z Has data issue: false hasContentIssue false
  • English
  • Français

On Events Represented by Probabilistic Automata of Different Types

Published online by Cambridge University Press:  20 November 2018

Arto Salomaa
Arto Salomaa*
Affiliation:
University of Turku, Finland, and University of Western Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 20 , 1968 , pp. 242 - 251
Copyright
Copyright © Canadian Mathematical Society 1968

References

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. Buharajev, R. G., Some equivalences in the theory of probabilistic automata, Verojatn. Metod. iKibernet. Ill , Kazan (1964), 45–65 (in Russian).Google Scholar
3. Ginsburg, S. and Rose, G. F., A characterization of machine mappings, Can. J. Math., 18 1966), 381–388.Google Scholar
4. Paz, A., Some aspects of probabilistic automata, Information and Control, 2 (1966), 26–60.Google Scholar
5. Rabin, M. O., Probabilistic automata, Information and Control, 6 (1963), 230–245.Google Scholar