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.

💡 Research Summary

The paper introduces a natural class of semigroups whose word problem can be decided by finite‑state automata (FSA) and investigates the algebraic and language‑theoretic properties of this class. The authors begin by defining an “automaton‑decidable semigroup” as a finitely generated semigroup (S) for which the set
\