论文信息 - Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages

Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages

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.

R. A. Thompson | R. Thompson

[1] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[2] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[3] Azaria Paz,et al. Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .

[4] Richard Arthur Thompson. Compact encoding of probabilistic languages , 1971 .

[5] Taylor L. Booth,et al. ENCODING OF PROBABILISTIC CONTEXT-FREE LANGUAGES , 1971 .

[6] Taylor L. Booth,et al. Sequential machines and automata theory , 1967 .

[7] Taylor L. Booth,et al. Applying Probability Measures to Abstract Languages , 1973, IEEE Transactions on Computers.