Automata and Computability (Hardcover, 1st. ed. 1997. Corr. 8th printing 2007)

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. 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 discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Undergraduate Texts in Computer Science
Release date:	June 2007
First published:	July 2007
Authors:	Dexter C. Kozen
Dimensions:	235 x 155 x 28mm (L x W x T)
Format:	Hardcover
Pages:	400
Edition:	1st. ed. 1997. Corr. 8th printing 2007
ISBN-13:	978-0-387-94907-9
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > Applications of computing > Artificial intelligence > Machine learning Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Automatic control engineering > Robotics Promotions
LSN:	0-387-94907-0
Barcode:	9780387949079

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!