|
Showing 1 - 8 of
8 matches in All Departments
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.
|
You may like...
Higher
Michael Buble
CD
(1)
R487
Discovery Miles 4 870
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.