On stochastic context-free languages

Authors:
T. Huang;K. S. Fu
Affiliations:
-;-
Venue:
Information Sciences: an International Journal
Year:
1971

Citing 3
Cited 4

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

Journal of the ACM (JACM)
Formal languages and their relation to automata

Formal languages and their relation to automata
Probabilistic representation of formal languages

SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)

A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification

IEEE Transactions on Computers
Maximum likelihood analysis of algorithms and data structures

Theoretical Computer Science
Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms

Pattern Recognition
Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.08

Visualization

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.