 |
|
|
Item Details
| Title:
|
GROUPS, LANGUAGES AND AUTOMATA
|
| By: |
Derek F. Holt, Sarah Rees, Claas E. Rover |
| Format: |
Hardback |
| List price:
|
£93.00 |
| Our price: |
£83.70 |
| Discount: |
|
| You save:
|
£9.30 |
|
|
|
|
|
| ISBN 10: |
1107152356 |
| ISBN 13: |
9781107152359 |
| Availability: |
Usually dispatched within 1-3 weeks.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
CAMBRIDGE UNIVERSITY PRESS |
| Pub. date: |
23 February, 2017 |
| Series: |
London Mathematical Society Student Texts 88 |
| Pages: |
306 |
| Description: |
A reference book discussing applications of formal language theory to group theory, particularly geometric and computational group theory. |
| Synopsis: |
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. |
| Illustrations: |
35 b/w illus. 25 exercises |
| Publication: |
UK |
| Imprint: |
Cambridge University Press |
| Returns: |
Returnable |
|
|
|
 |
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|