John M. Howie – författare

This book is an indispensable source for anyone with an interest in semigroup theory or whose research overlaps with this increasingly important area of mathematics. It is a clear and readable introduction to the subject, with emphasis on various classes of regular and semigroups. More than 150 exercises, accompanied by relevant references to the literature,give pointerse to areas of the subject not explicitly covered in the text.

Theoretical models of simple computing mahcines, known as automata, play a central role in theoretical computer science. This textbook presents an introduction to the theory of automata and to their connections with the study of languages.At the heart of the book is the notion that by considering a language as a set of words it is possible to construct automata which `recognize' words in the language. Consequently one can generate a correspondence between a hierarchy of machines and a corresponding hierarchy of grammars and languages.Professor Howie leads the reader from finite state automata through pushdown automata to Turing machines. He demonstrates clearly and elegantly the fundamental connections between automata and abstract algebra via the notions of syntactic monoid and minimal automaton.The author presupposes a basic familiarity with modern algebra, but beyond this the book is self-contained. As a result, the book will make ideal reading for students of mathematics and computer science approaching this subject for the first time.

Understanding the concepts and methods of real analysis is an essential skill for every undergraduate mathematics student. Written in an easy-to-read style, Real Analysis is a comprehensive introduction to this core subject and is ideal for self-study or as a course textbook for first and second-year undergraduates. Combining an informal style with precision mathematics, Real Analysis covers all the key topics with fully worked examples and exercises with solutions. Featuring: * Sequences and series - considering the central notion of a limit * Continuous functions * Differentiation * Integration * Logarithmic and exponential functions * Uniform convergence * Circular functions All these concepts and techniques are deployed in examples in the final chapter to provide the student with a thorough understanding of this challenging subject.

Complex analysis is one of the most attractive of all the core topics in an undergraduate mathematics course. Its importance to applications means that it can be studied both from a very pure perspective and a very applied perspective. This book takes account of these varying needs and backgrounds and provides a self-study text for students in mathematics, science and engineering. Beginning with a summary of what the student needs to know at the outset, it covers all the topics likely to feature in a first course in the subject, including: complex numbers, differentiation, integration, Cauchy's theorem, and its consequences, Laurent series and the residue theorem, applications of contour integration, conformal mappings, and harmonic functions. A brief final chapter explains the Riemann hypothesis, the most celebrated of all the unsolved problems in mathematics, and ends with a short descriptive account of iteration, Julia sets and the Mandelbrot set. Clear and careful explanations are backed up with worked examples and more than 100 exercises, for which full solutions are provided.

Aimed at 3rd and 4th year undergraduates and beginning graduates, this book provides a gentle introduction to this popular subject. Assuming a background of a first course in abstract algebra, the book begins with a review of rings, ideals, quotients and homomorphisms. Polynomials, a key topic in field theory, are then introduced in the second chapter. Field extensions and splitting fields are the topics of Chapters 3 and 4, and there is an account of ruler and compass constructions, and a proof that "squaring the circle" is impossible, in Chapter 5. Chapter 6 uses the theory developed in Chapters 3 and 4 to give a description of finite fields, and includes a brief account of the use of such fields in coding theory. The book then concludes with the Galois group, normal and separable extensions, an account of polynomial equations, and the celebrated result that the quintic equation is not soluble by radicals.The aim is to provide a readable, "student-friendly" introduction that takes a more "natural" approach to its subject (as compared to the more formal introductions by Stewart and Garling), and that features clear explanations and plenty of worked examples and exercises - with full solutions - to encourage independent study.

Presents the proceedings of the conference on semigroups with applications held in Oberwolfach, Germany, in 1991.

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.

This volume contains contributions from leading experts in the rapidly developing field of semigroup theory. The subject, now some 60 years old, began by imitating group theory and ring theory, but quickly developed an impetus of its own, and the semigroup turned out to be the most useful algebraic object in theoretical computer science.

This book is concerned with the structure of linear semigroups, that is, subsemigroups of the multiplicative semigroup Mn(K) of n × n matrices over a field K (or, more generally, skew linear semigroups — if K is allowed to be a division ring) and its applications to certain problems on associative algebras, semigroups and linear representations. It is motivated by several recent developments in the area of linear semigroups and their applications. It summarizes the state of knowledge in this area, presenting the results for the first time in a unified form. The book's point of departure is a structure theorem, which allows the use of powerful techniques of linear groups. Certain aspects of a combinatorial nature, connections with the theory of linear representations and applications to various problems on associative algebras are also discussed.