Universal Algebra and Applications in Theoretical Computer Science
Autor Klaus Denecke, Shelly L. Wismathen Limba Engleză Hardback – 18 ian 2002
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.
Preț: 811.97 lei
Preț vechi: 1014.96 lei
-20% Nou
Puncte Express: 1218
Preț estimativ în valută:
155.39€ • 161.41$ • 129.08£
155.39€ • 161.41$ • 129.08£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781584882541
ISBN-10: 1584882549
Pagini: 383
Ilustrații: 40 Illustrations, black and white
Dimensiuni: 156 x 234 x 32 mm
Greutate: 0.76 kg
Ediția:1
Editura: CRC Press
Colecția Chapman and Hall/CRC
Locul publicării:Boca Raton, United States
ISBN-10: 1584882549
Pagini: 383
Ilustrații: 40 Illustrations, black and white
Dimensiuni: 156 x 234 x 32 mm
Greutate: 0.76 kg
Ediția:1
Editura: CRC Press
Colecția Chapman and Hall/CRC
Locul publicării:Boca Raton, United States
Public țintă
UndergraduateCuprins
Basic Concepts. Galois Connections and Closures. Homomorphisms and Isomorphisms. Direct and Subdirect Products. Terms, Trees, and Polynomials. Identities and Varieties. Term Rewriting Systems. Algebraic Machines. Mal'cev-type Conditions. Clones and Completeness. Tame Congruence Theory. Term Condition and Commutator. Complete Sublattices. G-Clones and M-Solid Varieties. Hypersubstitutions and Machines. Bibliography. Index.
Notă biografică
Denecke, Klaus; Wismath, Shelly L.
Descriere
Universal Algebra and Applications in Theoretical Computer Science introduces the concepts of universal algebra, surveys some of the newer developments in the field, and offers a unique opportunity to build the foundation needed for further 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, and commutators.