2nd Edition
Hardback (03 Feb 1994)
Save $1.14
Includes delivery to the United States
10+ copies available online - Usually dispatched within 7 days
Computability, Complexity, and Languages is an introductory text that 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.
| ISBN: | 9780122063824 |
| Publisher: | Elsevier Science |
| Imprint: | Morgan Kaufmann |
| Pub date: | 03 Feb 1994 |
| Edition: | 2nd Edition |
| DEWEY: | 511.3 |
| DEWEY edition: | 20 |
| Language: | English |
| Number of pages: | 609 |
| Weight: | 1018g |
| Height: | 236mm |
| Width: | 162mm |
| Spine width: | 48mm |
$3.22off
Paperback
Published 30 Sep 2016
Save $3.22
$8.68off
Hardback
Published 06 Jul 2023
Save $8.68
$11.98off
Hardback
Published 02 Aug 2023
Save $11.98
$1.50off
Paperback
Published 26 Jul 2023
Save $1.50
$4.45off
Paperback
Published 26 Jun 2023
Save $4.45
