Vertel uw vrienden over dit artikel:
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Computer Science and Scientific Computing Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.) 2e uitgave
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Computer Science and Scientific Computing
Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.)
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.
609 pages, further reading, index
| Media | Boeken Hardcover Book (Boek met harde rug en kaft) |
| Vrijgegeven | 3 februari 1994 |
| ISBN13 | 9780122063824 |
| Uitgevers | Elsevier Science & Technology |
| Pagina's | 609 |
| Afmetingen | 162 × 236 × 48 mm · 1,10 kg |
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld