On the Word Problem for Special Monoids

TL;DR

This paper characterizes the language-theoretic properties of the word problem in special monoids, showing it is context-free if and only if their group of units is virtually free, thus generalizing key theorems and solving longstanding questions.

Contribution

It provides a complete characterization of the word problem's language class for special monoids in terms of their group of units, extending the Muller-Schupp theorem.

Findings

A special monoid has a context-free word problem iff its group of units is virtually free.

Decidability of the word problem's language class in polynomial time for one-relation special monoids.

Language-theoretic properties of congruence classes match those of the word problem.

Abstract

A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the word problem, in the sense of Duncan & Gilman, for special monoids in terms of their group of units. We prove that a special monoid has context-free word problem if and only if its group of units is virtually free, giving a full generalisation of the Muller-Schupp theorem. This fully answers, for the class of special monoids, a question posed by Duncan & Gilman in 2004. We describe the congruence classes of words in a special monoid, and prove that these have the same language-theoretic properties as the word problem. This answers a question first posed by Zhang in 1992. As a corollary, we prove that it is decidable (in polynomial time) whether a special one-relation monoid has context-free word problem. This completely answers another question from 1992, also posed by Zhang.