Probabilistic automaton
 | This article is actively undergoing a major edit for a little while. To help avoid edit conflicts, please do not edit this page while this message is displayed. This page was last edited at 12:20, 31 May 2007 (UTC) (17 years ago) – this estimate is cached, . Please remove this template if this page hasn't been edited for a significant time. If you are the editor who added this template, please be sure to remove it or replace it with {{Under construction}} between editing sessions. |
In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non-deterministic finite automaton; it includes the probability of transition into the transition function. The concept was introduced by M. O. Rabin in 1963[1]; a certain special case is sometimes known as the Rabin automaton.
Definition
References
- ^ M. O Rabin,"asdf",
- Arto Salomaa, Theory of Austomata (1969) Pergamon Press, Oxford (See chapter 2').