By John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
Descripción: This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. With eBooks you can: search for key concepts, words and phrases make highlights and notes as you study share your notes with friends eBooks are downloaded to your computer and accessible either offline through the Bookshelf (available as a free download), available online and also via the iPad and Android apps. Upon purchase, you'll gain instant access to this eBook. Time limit The eBooks products do not have an expiry date. You will continue to access your digital ebook products whilst you have your Bookshelf installed.
Contenido: Chapter 1. Automata: The Methods and the Madness
Chapter 2. Finite Automata
Chapter 3. Regular Expressions and Languages
Chapter 4. Properties of Regular Languages
Chapter 5. Context-Free Grammars and Languages
Chapter 6. Pushdown Automata
Chapter 7. Properties of Context-Free Languages
Chapter 8. Introduction to Turing Machines
Chapter 9. Undecidability
Chapter 10. Intractable Problems
Material: