Groups, languages and automata
Author(s)
Bibliographic Information
Groups, languages and automata
（London Mathematical Society student texts, 88）
Cambridge University Press, 2017
- : hardback
- : pbk
Available at / 17 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 270-282) and indexes
Description and Table of Contents
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.
Table of Contents
- 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.
by "Nielsen BookData"
