Introduction to Automata Theory, Languages, and Computation
Pearson New International Edition
3rd Edition
Published on 1. November 2013
Book
Paperback/Softback
496 pages
978-1-292-03905-3 (ISBN)
Description
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.
More details
Edition
3rd edition
Language
English
Place of publication
Harlow
United Kingdom
Target group
Professional and scholarly
Dimensions
Height: 279 mm
Width: 216 mm
Thickness: 30 mm
Weight
1240 gr
ISBN-13
978-1-292-03905-3 (9781292039053)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
John E. Hopcroft | Rajeev Motwani | Jeffrey D. Ullman
Introduction to Automata Theory, Languages, and Computation
Pearson New International Edition
E-Book
10/2013
3rd Edition
Pearson
from
€48.14
Available for download
Previous edition
John E. Hopcroft | Rajeev Motwani | Jeffrey D. Ullman
Introduction to Automata Theory, Languages, and Computation
International Edition
Book
08/2006
3rd Edition
Pearson
€173.31
Article exhausted; check for reprint
Content
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
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