Weighted context-free grammars over valuation monoid and their languages

zbMATH Open1424.68082MaRDI QIDQ4623960FDOQ4623960

Authors:

Publication date: 22 February 2019

Recommendations

• Weighted context-free grammars over bimonoids
• The Chomsky-Schützenberger theorem for quantitative context-free languages
• Sequential grammars and automata with valences
• Algebraic properties of weighted pushdown automata over valuation monoid
• scientific article; zbMATH DE number 2087232

zbMATH Keywords

valuation monoidweighted context-free grammarsweighted context-free languagesweighted Chomsky normal formweighted Greibach normal form

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (8)

• The Chomsky-Schützenberger theorem for quantitative context-free languages
• Algebraic properties of weighted pushdown automata over valuation monoid
• Weighted context-free grammars over bimonoids
• Title not available (Why is that?)
• Sequential grammars and automata with valences
• On the capabilities of grammars, automata, and transducers controlled by monoids
• Weighted iterated linear control
• The normal form of lattice-valued context free grammars

This page was built for publication: Weighted context-free grammars over valuation monoid and their languages

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