Probabilistic grammars and languages

Author

Richard H. Sady

Date of Award

12-1981

Degree Type

Thesis

Degree Name

Master of Science

Major

Computer Science

Major Professor

Michael G. Thomason

Abstract

This work is a study of three areas in the theory of probabilistic grammars and languages. First, the relationship of branching processes to probabilistic context-free grammars is investigated. Second, a method is given for finding probabilities of certain strings in context-free languages given "regular-like" expressions representing the languages. Finally, it is shown that there is no natural way of extending Parikh's Theorem to a probabilistic version.

Recommended Citation

Sady, Richard H., "Probabilistic grammars and languages. " Master's Thesis, University of Tennessee, 1981.
https://trace.tennessee.edu/utk_gradthes/15285