This book focuses on fundamental issues of computation. The readers can master the content and gain lasting perspective from which to understand computers by carefully worked out examples, illustrations, and algorithmic proofs. KEY TOPICS: Teaches the fundamental concepts behind computation. Hundreds of exercises marked according to the level of difficulty provide readers ample opportunity to apply concepts. Hundreds of illustrations which enhance understanding. Only algorithmic proofs are given in the text allowing readers to calibrate the mathematical depth they want to pursue. MARKET: Appropriate for upper division undergraduate and graduate level courses in Computer Science Theory, Theory of Computation, and Automata and Formal Language Theory.
Table of contents
2. Finite Automata.
3. Context Free Languages.
4. Turing Machines.
6. Computational Complexity.
List of Symbols.
All the material you need to teach your courses.Discover teaching material
Published by Pearson (June 13th 2000) - Copyright © 2001