On stochastic context-free languages

DOI10.1016/S0020-0255(71)80007-5MaRDI QIDQ2548861zbMATH OpenFDO

Authors Yanyan Li

Publication date 1971

Published in Information Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites work

• scientific article; zbMATH DE number 3458504 (Why is no real title available?)
• scientific article; zbMATH DE number 3226524 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3313290 (Why is no real title available?)
• scientific article; zbMATH DE number 3344522 (Why is no real title available?)
• scientific article; zbMATH DE number 3402108 (Why is no real title available?)
• scientific article; zbMATH DE number 3408934 (Why is no real title available?)
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• On certain formal properties of grammars
• On context-free languages and push-down automata
• On stochastic context-free languages
• On stochastic languages
• Probabilistic and weighted grammars
• Probabilistic automata
• Programmed Grammars and Classes of Formal Languages

Cited in

(8)

• On stochastic context-free languages
• Classes of formal grammars
• Moments of string and derivation lengths of stochastic context-free grammars
• Examples of formal grammars with weights
• Maximum likelihood analysis of algorithms and data structures
• Stochastic grammars and languages
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• L-fuzzy grammars

This page was built for publication: On stochastic context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2548861)