LOGIC AND LANGUAGE MODELS FOR COMPUTER SCIENCE 3E

This text presents the formal concepts underlying Computer Science.

It starts with a wide introduction to Logic with an emphasis on reasoning and proof, with chapters on Program Verification and Prolog.

The treatment of computability with Automata and Formal Languages stands out in several ways:

it emphasizes the algorithmic nature of the proofs and the reliance on simulations;

it stresses the centrality of nondeterminism in generative models and the relationship to deterministic recognition models

The style is appropriate for both undergraduate and graduate classes.

Readership: Students and professionals interested in theoretical computation and language models for computer science.

This is a textbook for a Theory of Computation course; it is designed for undergraduates but at many colleges/universities it can be used for a graduate course. In particular, it is distinguished by a strong emphasis on Logic, spending several chapters on the subject rather than the typical 10-page treatment. It presents the primary topics of a Theory course, automata theory, formal languages, and computability.