2020/03/30 by Brough, Tara
#03D40 #20F10 #20M17 #68Q45 #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR)
paper · doi:10.48550/arxiv.2003.13608
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages \mathfrakC(including context-free), every completely regular semigroup that is a union of finitely many finitely generated groups with word problem in \mathfrakC also has word problem in \mathfrakC. We give an example to show that not all completely regular semigroups with context-free word problem can be so constructed.