Generic complexity of word problem in some semigroups

Generic algorithms decide problems on sets of almost all inputs, outputting an indefinite answer for other rare inputs. We will prove that the word problem is generically decidable in finitely generated semigroups $\mathfrak{S}$, for which there exists a congruence $\theta$ such that the semigroup $\mathfrak{S}/ \theta$ is an infinite residually finite monoid with cancellation property and decidable word problem. This generalizes the author' earlier result on generic decidability of the word problem in finitely presented semigroups that remain infinite when adding commutativity and cancelling properties. Examples of such semigroups are one-relator semigroups as well as so-called balanced semigroups, for which generic decidability of the word problem has been proved by Won. In particular, balanced are Tseitin and Makanin's classical semigroups with undecidable word problem.