Automata, Computability and Complexity: Theory and ApplicationsThe theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of modern hardware and software systems. The goal of this book is to change that. The book is organized into a core set of chapters (that cover the standard material suggested by the title), followed by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, networks, security, natural language processing, artificial intelligence, game playing, and computational biology.
The core material includes discussions of finite state machines, Markov models, hidden Markov models (HMMs), regular expressions, contextfree grammars, pushdown automata, Chomsky and Greibach normal forms, contextfree parsing, pumping theorems for regular and contextfree languages, closure theorems and decision procedures for regular and contextfree languages, Turing machines, nondeterminism, decidability and undecidability, the ChurchTuring thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of firstorder logic, asymptotic dominance, time and space complexity, the CookLevin theorem, NPcompleteness, Savitch's Theorem, time and space hierarchy theorems, randomized algorithms and heuristic search. Throughout the discussion of these topics there are pointers into the application chapters. So, for example, the chapter that describes reduction proofs of undecidability has a link to the security chapter, which shows a reduction proof of the undecidability of the safety of a simple protection framework. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Review: Automata, Computability and Complexity: Theory and Applications
User Review  Wouter Pinnoo  GoodreadsA mustread. Read full review
Review: Automata, Computability and Complexity: Theory and Applications
User Review  Tom Naessens  GoodreadsVery good & readable book; lots of explanation which aren't too hard to understand or too trivial. Read full review
Contents
M02_RICH8064_01_SE_C02  8 
M03_RICH8064_01_SE_C03  21 
M04_RICH8064_01_SE_C04  36 
Copyright  
45 other sections not shown