Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Groups, Languages and Automata

£29.99

Part of London Mathematical Society Student Texts

  • Date Published: February 2017
  • availability: In stock
  • format: Paperback
  • isbn: 9781316606520

£ 29.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Can be used as a primary text for new postgraduates
    • Contains detailed coverage of many of the interesting examples arising in geometric group theory, including hyperbolic groups, manifold groups, braid groups, Coxeter groups, and more
    • Includes all the necessary background material, with sketch proofs or exercises for the more important results on which the applications to group theory depend
    Read more

    Reviews & endorsements

    '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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: February 2017
    • format: Paperback
    • isbn: 9781316606520
    • length: 306 pages
    • dimensions: 227 x 152 x 18 mm
    • weight: 0.44kg
    • contains: 35 b/w illus. 25 exercises
    • availability: In stock
  • 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.

  • Authors

    Derek F. Holt, University of Warwick
    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, University of Newcastle upon Tyne
    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, National University of Ireland, Galway
    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.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×