Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Punto Poste 5.49 € Punto Poste 5.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 € Corriere Bartolini 4.49 € Punto Bartolini 3.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Computability, Complexity, and Languages

Name: Computability, Complexity, and Languages
Brand: Morgan Kaufmann
SKU: 39571104
Price: 49.59 EUR
Availability: InStock
Author: Martin Davis
ISBN: 9780080502465

Fundamentals of Theoretical Computer Science

Martin Davis

Ron Sigal

Elaine J. Weyuker

Lingua

Inglese

Libro elettronico Adobe ePub DRM

Codice Libristo: 39571104

Casa editrice Morgan Kaufmann, marzo 1994

Computability, Complexity, and Languages is an introductory text that covers the key areas of comput... Descrizione completa

Codice Libristo: 39571104

121 b

49.59 €

Disponibile Consegna digitale immediata

I clienti hanno acquistato anche

Frederik Rostgaards LIV Og Levnet... Christian Bruun

In brossura

30.79 €

Mécanique des systèmes Sornette

In brossura

20.49 €

Un conde para la senorita Stafford Evans Mariah Evans

MP3

5.99 €

Yogas tra - Les aphorismes de l'école de Yoga Pierre Patanjali

In brossura

23.39 €

Potyczki w raju Angie Hockman

In brossura

9.19 €

Le Doute Goettmann

In brossura

18.49 €

Verwaltungsgerichtlicher Rechtsschutz in Konkurrenzsituationen. Walter Frenz

In brossura

53.89 €

El Poder En Tus Manos WALLACE H HEFLIN

In brossura

9.19 €

Fairy Tail 22 Hiro Mashima

In brossura

7.29 €

Diseno Multisensorial, Diseno Centrado En Los Sentidos Deyanira Bedolla Pereda

In brossura

76.09 €

Aby Warburgs Schlangenritual - Eine Theorie von Magie in den Künsten Vukan Mihailovic de Deo

In brossura

14.09 €

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 "e;universal"e; 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.