scientific article; zbMATH DE number 1257079

MaRDI QIDQ4228735zbMATH OpenFDO

Authors Boris Melnikov

Publication date 17 May 1999

zbMATH Keywords

CF-grammarsequivalence problemsfree monoids

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• On an extension of the class of context-free languages
• The complexity of equivalence problems for commutative grammars
• On the commutative equivalence of context-free languages
• On the equality of grammatical families
• Complexity of problems of commutative grammars

Cited in

(1)

• An efficient automata approach to some problems on context-free grammars.

This page was built for publication:

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