scientific article; zbMATH DE number 1257079

zbMATH Open0925.20071MaRDI QIDQ4228735FDOQ4228735

Authors: Boris Melnikov 

Publication date: 17 May 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

free monoidsequivalence problemsCF-grammars

Mathematics Subject Classification ID

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

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)