probabilistic automaton


probabilistic automaton

[‚präb·ə·bə′lis·tik ȯ′täm·ə‚tän] (computer science) A device, with a finite number of internal states, which is capable of scanning input words over a finite alphabet and responding by successively changing its internal state in a probabilistic way. Also known as stochastic automaton.

probabilistic automaton

nondeterministic automaton