Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science |
|
| Author:
| Davis, Martin
Sigal, Ron
Weyuker, Elaine J. |
| Series title: | Computer Science and Scientific Computing Ser. |
| ISBN: | 978-0-12-206382-4 |
| Publication Date: | Feb 1994 |
| Publisher: | Elsevier Science & Technology Books
|
| Book Format: | Hardback |
| List Price: | AUD $131.95 |
Book Description:
|
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.
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.