Applying Probability Measures to Abstract Languages

IEEE Transactions on Computers

Volumn C-22, Issue 5, 1973, Pages 442-450

  Booth, Taylor L ^a   Thompson, Richard A ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Abstract languages; probabilistic languages; stochastic automata; word functions

Indexed keywords

PROBABILITY;

PROBABILISTIC LANGUAGES;

AUTOMATA THEORY;

EID: 0015617823     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1973.223746     Document Type: Article

References (11)

1. A. T. Bharucha-Reid, Elements of the Theory of Markov Processes and Their Applications. New York: McGraw-Hill, 1960.
2. T. L. Booth, Sequential Machines and Automata Theory. New York: Wiley, 1967.
3. —, “Probabilistic representation of formal languages,” in IEEE Conf. Rec. 10th Symp. Switching and Automata Theory, 1969.
4. C. A. Ellis, “Probabilistic languages and automata,” Ph.D. dissertation, Univ. Illinois, Urbana, 1969.
5. S. Ginsburg, The Mathematical Theory of Context-Free Languages. New York: McGraw-Hill, 1966.
6. U. Grenander, “Syntax-controlled probabilities,” Div. Appl. Math., Brown Univ., Providence, R.I., Internal Rep., 1967.
7. T. E. Harris, The Theory of Branching Processes. Berlin: Springer, 1963.
8. J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata. Reading, Mass.: Addison-Wesley, 1969.
9. A. Paz, Introduction to Probabilistic Automata. New York: Academic, 1971.
10. A. Salomma, “Probabilistic and weighted grammars,” Inform. Contr., vol. 15, pp. 529–544, 1969.
11. R. A. Thompson, “Compact encoding of probabilistic languages,” Ph.D. dissertation, Comput. Sci. Group, Dep. Elec. Eng., Univ. Connecticut, Storrs, 1971.