@article {zbMATH05853799,
	title = {Finite complete rewriting systems for regular semigroups.},
	journal = {Theor. Comput. Sci.},
	volume = {412},
	number = {8-10},
	year = {2011},
	note = {<p>n/a</p>
},
	pages = {654{\textendash}661},
	publisher = {Elsevier, Amsterdam},
	abstract = {<p>It is proved that, given a (von Neumann) regular semigroup with finitely many left and right ideals, if every maximal subgroup is presentable by a finite complete rewriting system, then so is the semigroup. To achieve this, the following two results are proved: the property of being defined by a finite complete rewriting system is preserved when taking an ideal extension by a semigroup defined by a finite complete rewriting system; a completely 0-simple semigroup with finitely many left and right ideals admits a presentation by a finite complete rewriting system provided all of its maximal subgroups do.</p>
},
	issn = {0304-3975},
	doi = {10.1016/j.tcs.2010.10.020},
	url = {http://dx.doi.org/10.1016/j.tcs.2010.10.020},
	author = {R.D. {Gray} and Malheiro, A.}
}
