Automata, Computability and Complexity: Theory and Applications
- ISBN-10
- 0132288060
- ISBN-13
- 9780132288064
- Category
- Computers
- Pages
- 1099
- Language
- English
- Published
- 2008
- Publisher
- Prentice Hall
- Author
- Elaine Rich
Description
The 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, context-free grammars, pushdown automata, Chomsky and Greibach normal forms, context-free parsing, pumping theorems for regular and context-free languages, closure theorems and decision procedures for regular and context-free languages, Turing machines, nondeterminism, decidability and undecidability, the Church-Turing thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of first-order logic, asymptotic dominance, time and space complexity, the Cook-Levin theorem, NP-completeness, 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.
Get the book
Similar books
-
Automata, Computability and Complexity: Theory and Applications
By Elaine RichAutomata, Computability and Complexity: Theory and Applications
-
Automata and Computability
By Dexter C. KozenThese are my lecture notes from CS381/481: Automata and Computability Theory, a one-semester senior-level course I have taught at Cornell Uni versity for many years.
-
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
By Martin Davis, Elaine J. Weyuker, Ron SigalMichael Harrison, Introduction to Formal Language Theory. Addison-Wesley, Reading, Massachusetts, 1978. A comprehensive, up-to-date, readable treatise on formal languages. Karel Hrbacek and Thomas Jech, Introduction to Set Theory, ...
-
Automata, Computability and Complexity: Theory and Applications
By Elaine RichAutomata, Computability and Complexity: Theory and Applications
-
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
By Juraj HromkovičThe book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network ...
-
Computability and Complexity Theory
By Steven Homer, Alan L. SelmanSubstantial new content in this edition includes: a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp─Lipton. a chapter studying properties of the fundamental probabilistic complexity ...
-
Computability and Complexity: From a Programming Perspective
By Neil D. JonesNew results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive "constant speedup" property: that almost any program can ...
-
Introduction to the Theory of Computation
By Michael SipserWe must show that any sufficiently long string .9 in A can be pumped and remain in A. The idea behind this approach is simple. Let s be a very long string in A. (We make clear later what we mean by “very long.”) Because 8 is in A, ...
-
Problem Solving in Automata, Languages, and Complexity
By Ding-Zhu Du, Ker-I KoThis book provides, in an accessible, practically oriented style, a thorough grounding in these topics for practitioners and students on all levels.
-
Introduction to the Theory of Computation
By Michael Sipser"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation.