Groups, Languages and Automata

Description

Fascinating connections exist between group theory and automata theory, and a wide variety of them are discussed in this text. Automata can be used in group theory to encode complexity, to represent aspects of underlying geometry on a space on which a group acts, and to provide efficient algorithms for practical computation. There are also many applications in geometric group theory. The authors provide background material in each of these related areas, as well as exploring the connections along a number of strands that lead to the forefront of current research in geometric group theory. Examples studied in detail include hyperbolic groups, Euclidean groups, braid groups, Coxeter groups, Artin groups, and automata groups such as the Grigorchuk group. This book will be a convenient reference point for established mathematicians who need to understand background material for applications, and can serve as a textbook for research students in (geometric) group theory.

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. Roever 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 'There are copious references and separate indices for notation, subjects, and names of earlier researchers. In summary, this text (written by three experts on the subjects) is a mostly self-contained condensation of hundreds of individual articles. It will serve as a valuable one-stop resource for both researchers and students.' Eric M. Freden, MathSciNet