Rewriting in Varieties of Idempotent Semigroups
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.
KeywordsRewriting identity problems varieties of semigroups
Unable to display preview. Download preview PDF.
- 7.Klíma, O.: Ph.D. thesis: Unification Modulo Associativity and Idempotency (2003), http://www.math.muni.cz/~klima/Math/Thesis/thesis.html
- 10.Nordahl, T.E.: On the Join of the Variety of All Bands and the Variety of All Commutative Semigroups via Conditional Rewrite Rules. In: Ito, M. (ed.) Words, Languages & Combinatorics, pp. 365–372. World Scientific, Singapore (1992)Google Scholar