On stochastic context-free languages

DOI10.1016/S0020-0255(71)80007-5zbMath0225.68041MaRDI QIDQ2548861

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On stochastic context-free languages
• On certain formal properties of grammars
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Probabilistic automata
• Programmed Grammars and Classes of Formal Languages
• Probabilistic and weighted grammars
• On stochastic languages
• On context-free languages and push-down automata