Determine invariance under changes of generating set

Determine whether the complexity classifications established for the Green representative languages of free inverse monoids are invariant under changing the finite generating set.

Background

The paper’s formal-language results are obtained using specified finite generating sets, principally the standard generating set of a free inverse monoid. It remains unresolved whether the resulting classifications—such as regularity, context-freeness, co-context-freeness, and related distinctions—depend on that choice. The authors explicitly identify invariance under a change of generating set as an important question.

References

An important question to address is the dependency of these results on the chosen generating set. We aim to determine whether the complexity classifications identified for these languages are invariant under change of the generating set.

— Green languages and growth of free inverse monoids  (2609.35251 - Bodart et al., 28 Sep 2026) in Section 11, Future work, item 3