Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science de

, ,

Éditeur :

Morgan Kaufmann


Paru le : 1994-03-18

eBook Téléchargement ebook sans DRM
Lecture en ligne (streaming)
43,24

Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

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 theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. - The number of exercises included has more than tripled. - Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.
Pages
609 pages
Collection
n.c
Parution
1994-03-18
Marque
Morgan Kaufmann
EAN papier
9781493300341
EAN EPUB SANS DRM
9780080502465

Informations sur l'ebook
Prix
43,24 €

Suggestions personnalisées