A textbook for an undergraduate course, requiring only a knowledge of basic linear algebra. Explains how to compute presentations for finitely generated cancell

Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal method

The study of nonunique factorizations of elements into irreducible elements in commutative rings and monoids has emerged as an independent area of research only

This book collects and coherently presents the research that has been undertaken since the author’s previous book Module Theory (1998). In addition to some of