Promo !

AUTOMATA AND COMPUTABILITY

41,90 31,43

UGS : 9f51684cbf37 Catégorie :

Description

PThis textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model’s rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and Gödel’s incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts./P

Informations complémentaires

Auteur

Editeur

Springer-Verlag New York Inc.; Édition : 1st. ed. 1997. Corr. 8th printing 2007 (30 juin 1997)

Langue

Collection

Undergraduate Texts in Computer Science

ISBN-10

9780387949079

ISBN-13

978-0387949079

Dimensions du produit

17,8 x 2,4 x 25,4 cm