The normal form of lattice-valued context free grammars

zbMATH Open1224.68042MaRDI QIDQ3072259FDOQ3072259

Authors: Li Sheng 

Publication date: 5 February 2011

Recommendations

• Weighted context-free grammars over valuation monoid and their languages
• A Greibach normal form for context-free graph grammars
• The syntactic concept lattice: another algebraic theory of the context-free languages?
• An easy proof of Greibach normal form
• scientific article; zbMATH DE number 1948159

zbMATH Keywords

Chomsky normal formGreibach normal formlattice monoidlattice-valued context free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (6)

• Title not available (Why is that?)
• Normal forms for multiple context-free languages and displacement Lambek grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Normal forms for context-free node-rewriting hypergraph grammars
• The lattice-valued Turing machines and the lattice-valued type 0 grammars

This page was built for publication: The normal form of lattice-valued context free grammars

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