Catégorie de recherche
Problème de recherche ?

Computability, Complexity, and Languages

Auteur: Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.)
Editeur: Elsevier Science & Technology
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.
Sur commande
ISBN / EAN 9780122063824
Auteur Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.)
Editeur Elsevier Science & Technology