Automata and Computability

Kozen, Dexter C.

ISBN 10: 0387949070 / ISBN 13: 9780387949079

Editore: Springer, 1997

VERY GOOD hardcover, no marks in text, tight binding, clean exterior. Codice articolo 148929

Riassunto:

<p>This 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>

Dalla quarta di copertina: This textbook provides undergraduate students with an introduction to the basic theoretical models of computability. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. Plenty of exercises are provided, ranging from the easy to the challenging.

Dati bibliografici

Titolo: Automata and Computability
Casa editrice: Springer
Data di pubblicazione: 1997
Legatura: Hardcover
Condizione: Very Good
Tipologia articolo: Book