Capa do artigo Computability, Complexity, And Languages

Computability, Complexity, And Languages

Fundamentals Of Theoretical Computer Science

by Martin Davis, Elaine J. (At&T Labs Research, Florham Park, New Jersey, U.S.A.) Weyuker, Ron (Consultant, New Haven, Connecticut, U.S.A.) Sigal e Martin (Courant Institute Of Mathematical Sciences Of New York University, New York, U.S.A.) Davis
language: english
Publisher: ELSEVIER SCIENCE & TECHNOLOGY, March of 1994 ‧
OUT OF STOCK OR NOT AVAILABLE
Sell ​​your book
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.

Computability, Complexity, And Languages

Fundamentals Of Theoretical Computer Science

by Martin Davis, Elaine J. (At&T Labs Research, Florham Park, New Jersey, U.S.A.) Weyuker, Ron (Consultant, New Haven, Connecticut, U.S.A.) Sigal e Martin (Courant Institute Of Mathematical Sciences Of New York University, New York, U.S.A.) Davis

Property Description
ISBN: 9780122063824
Publisher: ELSEVIER SCIENCE & TECHNOLOGY
Release Date: March of 1994
Language: English
Cover: Hardcover
Pages: 609
Format: Book
Collection: Computer Science And Scientific Computing
Categories: Books in English > Computing > Schedule
Books in English > Computing > Introduction to Computing
EAN: 9780122063824

BOOKS FROM THE SAME COLLECTION

SEE MORE TITLES FROM THIS COLLECTION

MARTIN DAVIS

SEE MORE TITLES BY THIS AUTHOR