Rewriting in Varieties of Idempotent Semigroups

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Science. Official publication website can be found on muni.cz.

Authors	KLÍMA Ondřej KORBELÁŘ Miroslav POLÁK Libor
Year of publication	2011
Type	Article in Proceedings
Conference	Algebraic Informatics
MU Faculty or unit	Faculty of Science
Citation
Doi	http://dx.doi.org/10.1007/978-3-642-21493-6_12
Field	General mathematics
Keywords	Rewriting; identity problems; varieties of semigroups
Description	We consider rewriting as a tool for solving identity problems in varieties of idempotent semigroups. It is known that there exist finite canonical term rewrite systems and finite canonical word rewrite systems for only a very limited number of those varieties. We present a finite canonical conditional word rewrite system for a particular variety in which the classical approaches cannot be applied. Moreover, we obtain infinite single letter deleting rewrite systems for each join-irreducible variety.
Related projects:	Institute for Theoretical Computer Science Mathematical structures and their physical applications Eduard Čech Center for Algebra and Geometry Algebraic Methods in Automata and Formal Language Theory II