| Title:
|
COMPUTABILITY, COMPLEXITY, AND LANGUAGES
FUNDAMENTALS OF THEORETICAL COMPUTER SCIENCE |
| By: |
Martin Davis, Ron Sigal, Elaine J. Weyuker |
| Format: |
Hardback |
| List price:
|
£49.99 |
| Our price: |
£49.99 |
|
|
|
|
|
| ISBN 10: |
0122063821 |
| ISBN 13: |
9780122063824 |
| Availability: |
This item will be printed on demand and will usually be dispatched within 10 days.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
ELSEVIER SCIENCE & TECHNOLOGY |
| Pub. date: |
17 February, 1994 |
| Edition: |
2nd edition |
| Series: |
Computer Science and Scientific Computing |
| Pages: |
609 |
| Description: |
Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory. |
| Synopsis: |
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. |
| Publication: |
US |
| Imprint: |
Morgan Kaufmann Publishers In |
| Returns: |
Non-returnable |