Groups, Languages and Automata

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Derek F. Holt, Sarah Rees, Claas E. Röver
Series: London Mathematical Society Student Texts 88
Publisher: Cambridge University Press
Year: 2017

Language: English
Pages: 306
Tags: Algebra;Abstract;Elementary;Intermediate;Linear;Pure Mathematics;Mathematics;Science & Math;Group Theory;Pure Mathematics;Mathematics;Science & Math;Algebra & Trigonometry;Mathematics;Science & Mathematics;New, Used & Rental Textbooks;Specialty Boutique

Contents pp v-viii
Preface pp ix-xii
PART ONE - INTRODUCTION pp 1-2
1 - Group theory pp 3-35
2 - Formal languages and automata theory pp 36-96
3 - Introduction to the word problem pp 97-114
PART TWO - FINITE STATE AUTOMATA AND GROUPS pp 115-116
4 - Rewriting systems pp 117-124
5 - Automatic groups pp 125-149
6 - Hyperbolic groups pp 150-168
7 - Geodesics pp 169-183
8 - Subgroups and coset systems pp 184-193
9 - Automata groups pp 194-218
PART THREE - THE WORD PROBLEM pp 219-220
10 - Solubility of the word problem pp 221-227
11 - Context-free and one-counter word problems pp 228-235
12 - Context-sensitive word problems pp 236-248
13 - Word problems in other language classes pp 249-255
14 - The co-word problem and the conjugacy problem pp 256-269
References pp 270-282
Index of Notation pp 283-283
Index of Names pp 284-286
Index of Topics and Terminology pp 287-294