Synopses & Reviews
Explores basic concepts of theoretical computer science and shows how they apply to current programming practice. Coverage ranges from classical topics, such as formal languages, automata, and compatibility, to formal semantics, models for concurrent computation, and program semantics.
Table of Contents
Mathematical Background.
Models for Computer Science: Automata and Grammars.
Solvable and Unsolvable Problems.
The Complexity of Computing.
Formal Semantics.
Proving Program Properties.
Nondetermination and Parallel Computation.