Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F.: Rewrite Systems for Varieties of Semigroups. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 396–410. Springer, Heidelberg (1990)
Baader, F., Nipkow, T.: Term Rewriting and All That. Camb. Univ. Press, Cambridge (1999)
Birjukov, A.P.: Varieties of Idempotent Semigroups. Algebra i Logika 9, 255–273 (1970); English translation in Algebra and Logic 9, 153–164 (1971)
Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, New York (1981)
Fennemore, C.F.: All Varieties of Bands I, II. Math. Nachr. 48, 237–252, 253-262 (1971)
Gerhard, J.A.: The Lattice of Equational Classes of Idempotent Semigroups. J. Algebra 15, 195–224 (1970)
Klíma, O.: Ph.D. thesis: Unification Modulo Associativity and Idempotency (2003), http://www.math.muni.cz/~klima/Math/Thesis/thesis.html
Neto, O., Sezinando, H.: Band Monoid Languages Revisited. Semigroup Forum 61(1), 32–45 (2000)
Newman, M.H.A.: On Theories with a Combinatorial Definition of ’Equivalence’. Annals of Mathematics 43(2), 223–243 (1942)
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)
Polák, L.: On Varieties of Completely Regular Semigroups I. Semigroup Forum 32, 97–123 (1985)
Polák, L.: On Varieties of Completely Regular Semigroups II. Semigroup Forum 36(3), 253–284 (1987)
Siekmann, J.H., Szabó, P.: A Noetherian and Confluent Rewrite System for Idempotent Semigroups. Semigroup Forum 25(1), 83–110 (1982)
Squier, C.C.: Word Problems and a Homological Finiteness Condition for Monoids. Journal of Pure and Applied Algebra 49, 201–217 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klíma, O., Korbelář, M., Polák, L. (2011). Rewriting in Varieties of Idempotent Semigroups. In: Winkler, F. (eds) Algebraic Informatics. CAI 2011. Lecture Notes in Computer Science, vol 6742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21493-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-21493-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21492-9
Online ISBN: 978-3-642-21493-6
eBook Packages: Computer ScienceComputer Science (R0)