Deciding Word Problems of Semigroups using Finite State Automata
  We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and algebraic properties of these semigroups. 
Max Neunh\"offer, Markus Pfeiffer, Nik Ruskuc
cs.FL math.CO math.GR