On stochastic context-free languages

T. Huang, K. S. Fu

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)201-224
Number of pages24
JournalInformation Sciences
Volume3
Issue number3
DOIs
StatePublished - Jul 1971

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this