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.
Les mer
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.
Les mer
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
Les mer
Presents theoretical concepts in a concise and accessible style.
Emphasises modern applications of the theory
Uses numerous figures to help convey ideas
Provides more detail and intuition for definitions and proofs
Challenges readers with extensive exercises at various levels of difficulty at the end of each chapter
Les mer
Provides more detail and intuition for definitions and proofs
Challenges readers with extensive exercises at various levels of difficulty at the end of each chapter
Includes additional practice and tests comprehension of important concepts with Gradiance an online homework and tutorial system. Please note, Gradiance is no longer available with this book.
Les mer
Produktdetaljer
ISBN
9781292039053
Publisert
2013-11-01
Utgave
3. utgave
Utgiver
Vendor
Pearson Education Limited
Vekt
1240 gr
Høyde
279 mm
Bredde
216 mm
Dybde
30 mm
Aldersnivå
P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
496