Derek F. Holt is a professor of mathematics at the University of Warwick. He authored the successful Handbook of Computational Group Theory, which has now become the standard text in the subject, and he co-authored The Maximal Subgroups of Low-Dimensional Groups (with John N. Bray and Colva M. Roney-Dougal, Cambridge, 2013). Holt was also one of five co-authors of the seminal book Word Processing in Groups (1992) on the theory of automatic groups, and has contributed mathematical software to the Magma and GAP systems. In 1981, he was awarded the London Mathematical Society Junior Whitehead Prize. Sarah Rees is a professor of pure mathematics at the University of Newcastle upon Tyne. She is an active researcher in the fields covered in this book, and has supervised a number of graduate students in this area. Claas E. Röver is a lecturer in mathematics at the National University of Ireland, Galway. He began researching the topics covered in this book during a post-doctoral position in Newcastle and has since contributed to the rapid development of this area of mathematics.

'The authors study how automata can be used to determine whether a group has a solvable word problem or not. They give detailed explanations on how automata can be used in group theory to encode complexity, to represent certain aspects of the underlying geometry of a space on which a group acts, its relation to hyperbolic groups … it will convince the reader of the beauty and richness of Group Theory.' Charles Traina, MAA Reviews

• Preface; Part I. Introduction: 1. Group theory; 2. Formal languages and automata theory; 3. Introduction to the word problem; Part II. Finite State Automata and Groups: 4. Rewriting systems; 5. Automatic groups; 6. Hyperbolic groups; 7. Geodesics; 8. Subgroups and co-set systems; 9. Automata Groups; Part III. The Word Problem: 10. Solubility of the word problem; 11. Context-free and one-counter word problems; 12. Context-sensitive word problems; 13. Word problems in other language classes; 14. The co-word problem and the conjugacy problem; References; Index of notation; Index of names; Index of topics and terminology.

Derek F. Holt is a professor of mathematics at the University of Warwick. He authored the successful Handbook of Computational Group Theory, which has now become the standard text in the subject, and he co-authored The Maximal Subgroups of Low-Dimensional Groups (with John N. Bray and Colva M. Roney-Dougal, Cambridge, 2013). Holt was also one of five co-authors of the seminal book Word Processing in Groups (1992) on the theory of automatic groups, and has contributed mathematical software to the Magma and GAP systems. In 1981, he was awarded the London Mathematical Society Junior Whitehead Prize. Sarah Rees is a professor of pure mathematics at the University of Newcastle upon Tyne. She is an active researcher in the fields covered in this book, and has supervised a number of graduate students in this area. Claas E. Röver is a lecturer in mathematics at the National University of Ireland, Galway. He began researching the topics covered in this book during a post-doctoral position in Newcastle and has since contributed to the rapid development of this area of mathematics.

'The authors study how automata can be used to determine whether a group has a solvable word problem or not. They give detailed explanations on how automata can be used in group theory to encode complexity, to represent certain aspects of the underlying geometry of a space on which a group acts, its relation to hyperbolic groups … it will convince the reader of the beauty and richness of Group Theory.' Charles Traina, MAA Reviews

• Preface; Part I. Introduction: 1. Group theory; 2. Formal languages and automata theory; 3. Introduction to the word problem; Part II. Finite State Automata and Groups: 4. Rewriting systems; 5. Automatic groups; 6. Hyperbolic groups; 7. Geodesics; 8. Subgroups and co-set systems; 9. Automata Groups; Part III. The Word Problem: 10. Solubility of the word problem; 11. Context-free and one-counter word problems; 12. Context-sensitive word problems; 13. Word problems in other language classes; 14. The co-word problem and the conjugacy problem; References; Index of notation; Index of names; Index of topics and terminology.

Derek F. Holt is a professor of mathematics at the University of Warwick. He authored the successful Handbook of Computational Group Theory, which has now become the standard text in the subject, and he co-authored The Maximal Subgroups of Low-Dimensional Groups (with John N. Bray and Colva M. Roney-Dougal, Cambridge, 2013). Holt was also one of five co-authors of the seminal book Word Processing in Groups (1992) on the theory of automatic groups, and has contributed mathematical software to the Magma and GAP systems. In 1981, he was awarded the London Mathematical Society Junior Whitehead Prize. Sarah Rees is a professor of pure mathematics at the University of Newcastle upon Tyne. She is an active researcher in the fields covered in this book, and has supervised a number of graduate students in this area. Claas E. Röver is a lecturer in mathematics at the National University of Ireland, Galway. He began researching the topics covered in this book during a post-doctoral position in Newcastle and has since contributed to the rapid development of this area of mathematics.

'The authors study how automata can be used to determine whether a group has a solvable word problem or not. They give detailed explanations on how automata can be used in group theory to encode complexity, to represent certain aspects of the underlying geometry of a space on which a group acts, its relation to hyperbolic groups … it will convince the reader of the beauty and richness of Group Theory.' Charles Traina, MAA Reviews

• Preface; Part I. Introduction: 1. Group theory; 2. Formal languages and automata theory; 3. Introduction to the word problem; Part II. Finite State Automata and Groups: 4. Rewriting systems; 5. Automatic groups; 6. Hyperbolic groups; 7. Geodesics; 8. Subgroups and co-set systems; 9. Automata Groups; Part III. The Word Problem: 10. Solubility of the word problem; 11. Context-free and one-counter word problems; 12. Context-sensitive word problems; 13. Word problems in other language classes; 14. The co-word problem and the conjugacy problem; References; Index of notation; Index of names; Index of topics and terminology.