Issue No. 06 - June (1974 vol. 23)
R.A. Thompson , Department of Electrical Engineering, Virginia Polytechnic Institute and State University
The nature of probability-measure languages (pm-languages) has been investigated , , , , 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.
Abstract languages, computability, grammar transformations, probabilistic languages, stochastic automata.
R. Thompson, "Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages," in IEEE Transactions on Computers, vol. 23, no. , pp. 603-614, 1974.