In this paper, properties of normalized stochastic languages are discussed and alternative procedures for constructing the Chomsky and Greibach normal forms for normalized stochastic context-free grammar (nscfg) are presented. A normalized stochastic context-free language (nscf l) is defined in terms of a nscfg. Furthermore, stochastic languages accepted by stochastic pushdown automata (spda) are defined, and relationships between stochastic context-free languages and spda are studied. The class of languages accepted by a spda with a 0 cutpoint is precisely the class of scf l.
ASJC Scopus subject areas
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence