A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Probabilistic Tree Automata
1970
Proceedings of the second annual ACM symposium on Theory of computing - STOC '70
It is quite natural to assign probabilities (or frequencies) to the sentences of a language to try to get some quantitative measure of "efficiency" of translators and grammars for the language. The model obtained by doing this is called a probabilistic language. Probabilistic languages, along with related concepts of probabilistic grammars and probabilistic automata are defined, and a specific application of this theory is presented in the development of Probabilistic Tree Automata which characterize Probabilistic Context Free Languages.
doi:10.1145/800161.805165
dblp:conf/stoc/Ellis70
fatcat:34ac7v3dpvforcnjsh63zqolyu