probabilistic automaton


Also found in: Wikipedia.

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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

probabilistic automaton

nondeterministic automaton
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
Mentioned in ?
References in periodicals archive ?
In classical computation, one only needs to sequence O(log([1/[epsilon])) identical copies of a given probabilistic automaton with one sided error p < 1 to run on the same input in order to obtain a machine with error bound [epsilon].
Succinctness of two-way probabilistic and quantum finite automata

Encyclopedia browser ?
Full browser ?