Logic and Language Models for Computer Science - Softcover

Hamburger, Henry; Richards, Dana

Softcover

ISBN 10: 0130654876 ISBN 13: 9780130654878

Publisher: Pearson, 2002

Synopsis

This text makes in-depth explorations of a broad range of theoretical topics in computer science. It plunges into the applications of the abstract concepts in order to confront and address the skepticism of readers, and instill in them an appreciation for the usefulness of theory. A two-part presentation integrates logic and formal language—both with applications. Chapter topics cover mathematical preliminaries, propositional logic, proving things: why and how, predicate logic, proving with predicates, program verification, logic programming, language models for computer science, language models, finite automata and their languages, regular expressions, Lex: a tool for building lexical scanners, context-free grammars, pushdown automata and parsing, and turing machines. For future computer scientists.

About this title

From the Back Cover

This book invites the reader to explore abstractions that are crucial to computer science. The authors bring a sense of excitement to logics, formal languages and automata—motivating topics by linking them to computing and to computational applications, sometime with whole chapters. They achieve exceptional clarity through a plethora of examples and figures, yet without-losing sight of, and indeed celebrating, the precision that is the hallmark of this subject matter.

Features of the book include:

• application of logic to program verification
• programming in the logic language, Prolog
• discussion of "why" and "how" to prove things
• relationships between English and programming languages
• diagrams-first approach to automata
• lex as a tool and an extension of formal language
• pushdown automata as parsing strategies
• Turing machines as models of computation

From the Inside Flap

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.

Edition details

• Publisher: Pearson
• Publication date: 2002
• ISBN 10: 0130654876
• ISBN 13: 9780130654878
• Binding: Paperback
• Language: English
• Edition number: 1
• Number of pages: 341