Weighted context-free grammars over bimonoids

DOI10.7561/SACS.2019.1.59OpenAlexW2972582338MaRDI QIDQ5089604FDOQ5089604

Authors: Faidra Torpari, George Rahonis 

Publication date: 19 July 2022

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7561/sacs.2019.1.59

Recommendations

• Weighted context-free grammars over valuation monoid and their languages
• The Chomsky-Schützenberger theorem for quantitative context-free languages
• scientific article; zbMATH DE number 6124028
• Extending Parikh's theorem to weighted and probabilistic context-free grammars
• Weighted finite automata over strong bimonoids

zbMATH Keywords

weightscontext-free grammarsbimonoids

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (4)

• Weighted parsing for grammar-based language models over multioperator monoids
• Extending Parikh's theorem to weighted and probabilistic context-free grammars
• Weighted context-free grammars over valuation monoid and their languages
• Weighted iterated linear control

This page was built for publication: Weighted context-free grammars over bimonoids

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