On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages

Krasimir Yordzhev

The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of fi…