The word problem for some classes of Adian inverse semigroups – II

  • Muhammad Inam

    Southern Arkansas University, Magnolia, USA
The word problem for some classes of Adian inverse semigroups – II cover
Download PDF

This article is published open access under our Subscribe to Open model.

Abstract

We introduce the notion of a subgraph generated by an -word of the Schützenberger graph of a positive word , , where contains as its subword. We show that the word problem for a finitely presented Adian inverse semigroup is decidable if the subgraphs of , for all , generated by all the -words over the presentation , are finite. As a consequence of this result, we show that the word problem is decidable for some classes of one relation Adian inverse semigroups.

Cite this article

Muhammad Inam, The word problem for some classes of Adian inverse semigroups – II. Port. Math. 82 (2025), no. 1/2, pp. 31–61

DOI 10.4171/PM/2137