ON STOCHASTIC CONTEXT-FREE LANGUAGES,

Abstract

In the report, normalized stochastic grammars (nsg) and stochastic pushdown automata (spda) are defined. Based on the concept of nsg, procedures for constructing the Chomsky and Greibach normal forms for normalized stochastic context-free grammars (nscfg) are presented. A stochastic context-free language (scfl) is defined in terms of a nscfg. Relationships between scfl and spda are studied. The class of languages accepted by a spda with cutpoint O is precisely the class of scfl. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1970
Accession Number
AD0706915

Entities

People

  • King Sun Fu
  • Tong Huang

Organizations

  • Purdue University

Tags

DTIC Thesaurus Topics

  • Automata
  • Context Free Grammars
  • Grammars
  • Language

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.