Finite complete rewriting systems for regular semigroups

Gray, R. and Malheiro, A. (2011) Finite complete rewriting systems for regular semigroups. Theoretical Computer Science, 412 (8-10). pp. 654-661.

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Mathematics
UEA Research Groups:	Faculty of Science > Research Groups > Algebra and Combinatorics
Depositing User:	Users 2731 not found.
Date Deposited:	21 Feb 2013 21:53
Last Modified:	15 May 2023 00:06
URI:	https://ueaeprints.uea.ac.uk/id/eprint/41517
DOI:	10.1016/j.tcs.2010.10.020

Actions (login required)

View Item