DocumentCode :
2200241
Title :
Probabilistic representation of formal languages
Author :
Booth, Taylor L.
fYear :
1969
fDate :
15-17 Oct. 1969
Firstpage :
74
Lastpage :
81
Abstract :
The problem of assigning a probability to each string of a language L(G) generated by a grammar G is considered. Two methods are considered. One method assigns a probability to each production associated with G and the other assigns the probabilities on the basis of particular features of the language. Several necessary conditions that must be satisfied by these probability assignment techniques if they are to be consistant are presented. The problem of recognizing languages is also considered. It is shown that under some conditions it is possible to recognize a non finitestate language with a finite state acceptor if one is willing to accept a small probability of making an error.
Keywords :
Bridges; Computer science; Digital systems; Formal languages; Probability; Production systems; Statistical analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Switching and Automata Theory, 1969., IEEE Conference Record of 10th Annual Symposium on
Conference_Location :
Waterloo, ON, Canada
ISSN :
0272-4847
Type :
conf
DOI :
10.1109/SWAT.1969.17
Filename :
4569603
Link To Document :
بازگشت