This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
June 1974 (vol. 23 no. 6)
pp. 603-614
R.A. Thompson, Department of Electrical Engineering, Virginia Polytechnic Institute and State University
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.
Index Terms:
Abstract languages, computability, grammar transformations, probabilistic languages, stochastic automata.
Citation:
R.A. Thompson, "Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages," IEEE Transactions on Computers, vol. 23, no. 6, pp. 603-614, June 1974, doi:10.1109/T-C.1974.224001
Usage of this product signifies your acceptance of the Terms of Use.