Universal Algebra and Applications in Theoretical Computer Science introduces the basic concepts of universal algebra and surveys some of the newer developments in the field. The first half of the book provides a solid grounding in the core material. A leisurely pace, careful exposition, numerous examples, and exercises combine to form an introduction to the subject ideal for beginning graduate students or researchers from other areas. The second half of the book focuses on applications in theoretical computer science and advanced topics, including Mal'cev conditions, tame congruence theory, clones, and commutators.
The impact of the advances in universal algebra on computer science is just beginning to be realized, and the field will undoubtedly continue to grow and mature. Universal Algebra and Applications in Theoretical Computer Science forms an outstanding text and offers a unique opportunity to build the foundation needed for further developments in its theory and in its computer science applications.

Introduction.
1. Basic concepts.
2. Galois connections and clousers.
3. Homommorphisms and isomorphisms.
4. Direct and subdirect products.
5. Terms, trees, and polynomials.
6. Identities and varieties.
7. Term rewriting systems.
8. Algebraic machines.
9. Mal’ cev-type conditions.
10. Clones and completeness.
11. Tama congruence theory.
12. Term condition and commutator.
13. Complete sublattices.
14. G-Clones and M-salud varieties.
15. Hypersubstitution and machines.
Bibliography.
Index.