Computability, Complexity and Languages: Fundamentals of Theoretical Computer Science

Free Shipping over $50

and free returns nationwide (rentals only)

14-day

Money Back Guarantee

Computability, Complexity and Languages: Fundamentals of Theoretical Computer Science

ISBN : 9780122063824
Publisher : Morgan Kaufmann Publishers In
Author(s) :
Edition : 2 Rev ed
Overview This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. The number of exercises included has more than tripled. Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.

Out of
Stock

Sorry but this item is out of stock, please check back again soon.