Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
- 1 June 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (6) , 603-614
- https://doi.org/10.1109/t-c.1974.224001
Abstract
The nature of probability-measure languages (pm-languages) has been investigated [2], [3], [7], [8], in particular, those languages generated by given probabilistic grammars (p-grammars). However, the determination of a p-grammar that can generate some given language has been an open question. Since languages are infinite in general, the specification of a pm-language is vague. In this paper, it is assumed that some finite representation exists for the set of words (this can be a nonprobabilistic grammar) and that the probability of each word in the language is computable by some word function whose domain is the language.Keywords
This publication has 1 reference indexed in Scilit:
- Applying Probability Measures to Abstract LanguagesIEEE Transactions on Computers, 1973