论文标题
某个关系的某些类别ADIAN ADIAN反向半群的单词问题
The word problem for some classes of one relation Adian inverse semigroups
论文作者
论文摘要
我们表明，如果每个正词的schützenberger图（仅包含$ r $ - 单词）作为子字，则是有限的，这是有限的，这是有限的，这是有限的，$ \ langle x | u = v \ rangle $，那么每个正面的schützenberger图表都是每个正面的词。这使我们能够为一个关系的某些类别逆向半群的某些类别解决问题。
We show that if the Schützenberger graph of every positive word, that contains an $R$-word only once as it's subword, is finite over an Adain presentation $\langle X|u=v\rangle$, then the Schützenberger graph of every positive word is finite over the presentation $\langle X|u=v\rangle$. This enable us to solve the word problem ffor some classes of one relation Adian inverse semigroups.
