Probabilistic grammars and automata*

https://doi.org/10.1016/S0019-9958(72)90026-5Get rights and content
Under an Elsevier user license
open archive

A mathematical formulation of probabilistic grammars, as well as the random languages generated by probabilistic grammars, is introduced. Various types of probabilistic grammars are considered. The relations between these grammars and the corresponding types of probabilistic automata are examined.

Cited by (0)

*

Work reported herein was supported in parts by the University Research Council of the Youngstown State University.

Copyright © 1972 Published by Elsevier Inc.