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

Abstract: We introduce the notion of a subgraph generated by an

R

-word

r

of the Sch"{u}tzenberger graph of a positive word

w

,

S G a m m a (w)

, where

w

contains

r

as its subword. We show that the word problem for a finitely presented Adian inverse semigroup

I n v l a n g l e X | R a n g l e

is decidable if the subgraphs of

S G a m m a (t)

, for all

t i n X^{+}

, generated by all the

R

-words over the presentation

l a n g l e X | R a n g l e

, 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.

This page was built for publication: The word problem for some classes of Adian inverse semigroups-II