Probabilistic tree automata and context free languages

M. Magidor*, G. Moran

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

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 languageEnglish
Pages (from-to)340-348
Number of pages9
JournalIsrael Journal of Mathematics
Volume8
Issue number4
DOIs
StatePublished - Dec 1970

Fingerprint

Dive into the research topics of 'Probabilistic tree automata and context free languages'. Together they form a unique fingerprint.

Cite this