Computer Science

Appropriate for upper division undergraduate and graduate level courses in Computer Science Theory, Theory of Computation, and Automata and Formal Language Theory.

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. It is especially appropriate for one-term courses.

• “Lead by example” approach.

  • Fundamental theorems are arrived at as generalizations of examples. Ex.___

• Fundamental concepts behind computation are taught.

  • Explains pattern matching, parsing, and helps to identify unsolvable problems. Ex.___

• Hundreds of exercises marked according to the level of difficulty.

  • Provides students ample opportunity to apply concepts. Ex.___

• Hundreds of illustrations.

  • Enhance understanding. Ex.___

• Only algorithmic proofs are given in the text—Other proof details are left to exercises.

  • Allows readers to calibrate the mathematical depth they want to pursue. Ex.___

(NOTE: Each chapter concludes with Exercises.)

1. Introduction.

Automata / Theory of Computation (Computer Science)

View a Sample Chapter PDF:

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, contact your Pearson Higher Education representative for pricing and ordering information.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.