Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars

DOI10.1007/978-3-319-66335-7_1zbMath1420.68102OpenAlexW2677601034MaRDI QIDQ5194920

Spencer Gordon, Vijay V. S. P. Bhattiprolu, Mahesh Viswanathan

Publication date: 17 September 2019

Published in: Quantitative Evaluation of Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2142/96262

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy ⋮ When is context-freeness distinguishable from regularity? An extension of Parikh's theorem ⋮ The Parikh Property for Weighted Context-Free Grammars

This page was built for publication: Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars