Automata and Computability

Kozen, Dexter C.

ISBN 10: 0387949070 / ISBN 13: 9780387949079

Editore: Springer, 1997

Riguardo questo articolo

The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Codice articolo GOR003375305

Dati bibliografici

• Titolo: Automata and Computability
• Editore: Springer
• Data di pubblicazione: 1997
• Lingua: Inglese
• ISBN 10: 0387949070
• ISBN 13: 9780387949079
• Rilegatura: Hardback
• Condizione: Very Good

Descrizione articolo

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.