Compact encoding of probabilistic languages
Compact encoding of probabilistic languages
Formal languages and their relation to automata
Formal languages and their relation to automata
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Applying Probability Measures to Abstract Languages
IEEE Transactions on Computers
A probabilistic model of computing with words
Journal of Computer and System Sciences
Language Correction Using Probabilistic Grammars
IEEE Transactions on Computers
| Hi-index | 14.98 |
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.