| We study the word problems on a certain type of semigroups and groups, for which we know that there is no algorithm to solve the word problem. We find some common characteristics on those algebraic structures. Then we find a generic solution of the word problem on those structures including famous known examples of groups and semigroups where the word problem is undecidable. |
