Also found in: Wikipedia.
probabilistic automaton[‚präb·ə·bə′lis·tik ȯ′täm·ə‚tän]
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.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)