Skip to content
Register Sign in Wishlist

A Second Course in Formal Languages and Automata Theory

£49.99

  • Date Published: November 2008
  • availability: Available
  • format: Hardback
  • isbn: 9780521865722

£ 49.99
Hardback

Add to cart Add to wishlist

Other available formats:
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
  • Written for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes. Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method, are covered here. The author places particular emphasis on the resources needed to represent certain languages. The book also includes a diverse collection of more than 200 exercises, suggestions for term projects, and research problems that remain open.

    • Covers many topics, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs and the compressibility method, not covered in other textbooks
    • Includes 200 exercises
    • Each chapter offers suggestions for term projects and research problems in the area
    Read more

    Reviews & endorsements

    'First courses in automata theory are now essential for both mathematicians and computer scientists, and there are some fine books from which one can learn the basics. But the question is: what next? … There is … a niche for second courses on automata theory that point the way to future study in the field without bludgeoning the reader under the weight of pages. At a shade under 250 pages Jeffrey Shallit's book is just such a second course. … The writing is crisp and no nonsense … Shallit has written a mathematically rigorous book that has avoided the pitfall of being unduly fussy.' SIAM Review

    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: November 2008
    • format: Hardback
    • isbn: 9780521865722
    • length: 254 pages
    • dimensions: 229 x 157 x 18 mm
    • weight: 0.48kg
    • contains: 12 tables 241 exercises
    • availability: Available
  • Table of Contents

    1. Review of formal languages and automata theory
    2. Combinatorics on words
    3. Finite automata and regular languages
    4. Context-free grammars and languages
    5. Parsing and recognition
    6. Turing machines
    7. Other language classes.

  • Instructors have used or reviewed this title for the following courses

    • Automata Theory
    • Automata and Computability Theory
    • Automata and Formal Language Theory
    • Formal Languages and Automata
    • Formal languages
    • Theoretical Computer Science
    • Theory of Automata and Formal Languages
  • Author

    Jeffrey Shallit, University of Waterloo, Ontario
    Jeffrey Shallit is Professor of the David R. Cheriton School of Computer Science at the University of Waterloo. He is the author of Algorithmic Number Theory (co-authored with Eric Bach) and Automatic Sequences: Theory, Applications, Generalizations (co-authored with Jean-Paul Allouche). He has published approximately 90 articles on number theory, algebra, automata theory, complexity theory, and the history of mathematics and computing.

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

Join us online

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.
×