|
|||||
|
|
Probabilistic tree automata and context free languages |
|
| Authors: | M. Magidor G. Moran |
| Affiliation: | (1) Institute of Mathematics, The Hebrew University of Jerusalem, Israel |
| 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. This research was partially supported by ONR, Contract No. N00014 69 C 0192. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |