The word problem for some classes of one relation Adian inverse semigroups
Group Theory
2020-01-14 v1 Combinatorics
Abstract
We show that if the Sch\"{u}tzenberger graph of every positive word, that contains an -word only once as it's subword, is finite over an Adain presentation , then the Sch\"{u}tzenberger graph of every positive word is finite over the presentation . This enable us to solve the word problem ffor some classes of one relation Adian inverse semigroups.
Cite
@article{arxiv.2001.03883,
title = {The word problem for some classes of one relation Adian inverse semigroups},
author = {Muhammad Inam},
journal= {arXiv preprint arXiv:2001.03883},
year = {2020}
}