2025/11/01 by Brough, Tara Macalister, Johnson, Marianne, Kambites, Mark +1
#03D40 #20F10 #20M18 #68Q45 #F.4.2 #F.4.3 #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR)
paper · doi:10.48550/arxiv.2511.00566
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.