论文标题
单词问题语言完全常规的半群
Word problem languages for completely regular semigroups
论文作者
论文摘要
在以下问题的激励下，完全常规的半群有无上下文的单词问题，我们表明，对于某些类别的语言，$ \ mathfrak {c} $（包括无上下文），每个完全常规的半群，这是有限的许多有限生成的与$ \ mathfrak {c} $中的单词问题有限的群体的结合。我们举例说明，并非所有具有无上下文单词问题的完全常规的半群都可以构建。
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of finitely many finitely generated groups with word problem in $\mathfrak{C}$ also has word problem in $\mathfrak{C}$. We give an example to show that not all completely regular semigroups with context-free word problem can be so constructed.
