Solution of an Open Problem on Probabilistic Grammars

DOI10.1109/TC.1983.1676313MaRDI QIDQ3040557zbMATH OpenOpenAlexFDO

Authors Ranjan Chaudhury, Son Pham, Oscar N. Garcia

Publication date 1983

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1983.1676313

zbMATH Keywords

expected derivation lengthexpected word lengthmean derivation lengthmean word lengthprobabilistic grammarsproduction probabilitiesunambiguous context-free grammar

Mathematics Subject Classification ID

Cited in

(4)

• Maximum likelihood analysis of algorithms and data structures
• Smoothing and compression with stochastic \(k\)-testable tree languages
• Consistency of stochastic context-free grammars
• Derived linear systems of context-free grammars

This page was built for publication: Solution of an Open Problem on Probabilistic Grammars

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