Introduction to Automata Theory, Languages, and ComputationThis 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 handson, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic homework assignments and programming labs into an interactive learning experience for students. By using a series of root questions and hints, it not only tests a student's capability, but actually simulates a oneonone teacherstudent tutorial that allows for the student to more easily learn the material. Through the programming labs, instructors are capable of testing, tracking, and honing their students' skills, both in terms of syntax and semantics, with an unprecedented level of assessment never before offered. For more information about Gradiance, please visit www.aw.com/gradiance. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Review: Introduction to Automata Theory, Languages, and Computation
User Review  Prashant Singh  GoodreadsSince I am a beginner it's a bit tough for me to grasp the subject. Read full review
very nice book
User Review  Shwetank Dhyani  FlipkartIf you are preparing for GATE or college exam, this book is one of the first few recommendations you will receive from people, and rightly so. Flipkart delivery and packaging was excellent as usual. Read full review
Contents
The Methods and the Madness  1 
Finite Automata  37 
Regular Expressions and Languages  85 
Copyright  
8 other sections not shown
Common terms and phrases
0's and l's 3SAT accepting algorithm alphabet automata binary blank boolean expression cells CFL's clause closure complement concatenation consider construction contextfree grammar contextfree languages counter machine defined deterministic DPDA eNFA edges equivalent Example Exercises for Section Figure finite automaton given Gradiance system grammar G graph halts Hamilton circuit homomorphism hypothesis ID's inductive input symbol instance integer labeled leftmost derivation length moves MPCP multitape nodes nondeterministic Nondeterministic Finite Automata notation NPcomplete number of 0's Onlyif operator pair parentheses parse tree path polynomial polynomialtime polynomialtime reduction proof prove pumping lemma pushdown automaton random recursive reduction regular expression regular languages replace represent sequence set of strings simulate solution statement steps strings of 0's subset suggested by Fig Suppose tape symbols Theorem TM's transition function truth assignment Turing machine undecidable variables