Abstract
A notion of a probabilistic tree automaton is defined and a condition is given under which it is equivalent to a usual tree automaton. A theorem about context free languages is stated.
Original language | English |
---|---|
Pages (from-to) | 340-348 |
Number of pages | 9 |
Journal | Israel Journal of Mathematics |
Volume | 8 |
Issue number | 4 |
DOIs | |
State | Published - Dec 1970 |