Emergent Mind
Word problem languages for completely regular semigroups
(2003.13608)
Published Mar 30, 2020
in
math.GR
and
cs.FL
Abstract
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.