Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, the fundamentals of data structures and algorithms, and discrete mathematics (including set theory, functions, relations, logic, and mathematical reasoning). Linz (U. of California, Davis) gives the motivation for proofs rather than their mathematical detail, focusing rather on the underlying principles as illustrated by examples. A sampling of topics covered includes finite and pushdown automata, regular and context-free languages and grammars, turing machines, and algorithmic and other models of computation. Annotation c. Book News, Inc., Portland, OR (booknews.com)