Motivated by applications in theoretical computer science, the theory of finite semigroups has emerged in recent years as an autonomous area of mathematics. It fruitfully combines methods, ideas and constructions from algebra, combinatorics, logic and topology. In simple terms, the theory aims at a classification of finite semigroups in certain classes called “pseudovarieties”. The classifying characteristics have both structural and syntactical aspects, the general connection between them being part of universal algebra. Besides providing a foundational study of the theory in the setting of arbitrary abstract finite algebras, this book stresses the syntactical approach to finite semigroups. This involves studying (relatively) free and profinite free semigroups and their presentations. The techniques used are illustrated in a systematic study of various operators on pseudovarieties of semigroups.
Pay easily by card, Klarna, Apple Pay or Google Pay. Not happy? You always have a 14-day money-back guarantee. Read more in our terms. If you have any questions, email us at hello@memmo.org.
Memmo makes studying easier – wherever you are in the world. We bring your course books and smart study tools together in one place: summaries, quizzes, podcasts and flashcards. Plus Ted, your study buddy who answers anything you wonder. Over 75,000 students already study here – built to help you learn faster and stress less.
You might also like
Buy the book0