Probabilistic Tree Automata
Clarence A. Ellis · 1970
The purpose of this paper is meant to be three-fold. First it will introduce the reader to the concepts of Probabilistic Languages and Probabilistic Grammars. Second, it indicates that previous definitions of probabilistic finite automaton have always been restricted to 1 of 8 classes of automaton and shows that other classes are useful. Third, the probabilistic concept is extended from finite automata to higher level automata (such as probabilistic PDAs and probabilistic Turing automata).