Free inverse monoids are co-context-free
Group Theory
2025-11-04 v1 Formal Languages and Automata Theory
Abstract
We prove (using grammars) that the free inverse monoid of every finite rank has co-context-free word problem. Equivalently, the co-word problem of the free inverse monoid of every finite rank is context-free.
Keywords
Cite
@article{arxiv.2511.00566,
title = {Free inverse monoids are co-context-free},
author = {Tara Macalister Brough and Marianne Johnson and Mark Kambites and Carl-Fredrik Nyberg-Brodda},
journal= {arXiv preprint arXiv:2511.00566},
year = {2025}
}
Comments
5 pages