Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science
- Binding: Hardcover
- Edition: 2
- Publisher: Lightning Source Inc
- Publish date: 04/01/1994
Description:
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.
Expand description
Product notice
Returnable at the third party seller's discretion and may come without consumable supplements like access codes, CD's, or workbooks.
Seller | Condition | Comments | Price |
BookReadingInc
|
Acceptable
|
$46.83
|
BookReadingInc
|
Good
|
$46.93
|
Ergodebooks
|
Good |
$31.63
|
mr_misanthropy
|
Good |
$32.07
|
|
BGV Books LLC
Good
|
$32.37
|
readmybooks
|
Acceptable |
$46.36
|
readmybooks
|
Good |
$46.46
|
TEXTBOOKHUT
|
Good |
$74.90
|
|
GridFreed
New |
$75.02
|
|
TEXTSHUB
Good
|
$79.82
|
Please Wait