Automata and Computability - Rilegato

Kozen, Dexter C.

Rilegato

ISBN 10: 0387949070 ISBN 13: 9780387949079

Casa editrice: Springer-Nature New York Inc, 2007

Riassunto

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.

Su questo libro

Contenuti:

Introduction * Finite Automata and Regular Sets * Pushdown Automata and Context-Free Languages * Turing Machines and Effective Computability * Homework Sets * Miscellaneous Exercises * Hints and Solutions

Product Description:

Book by Kozen Dexter C

Su questa edizione

• Editore: Springer-Nature New York Inc
• Data di pubblicazione: 2007
• ISBN 10: 0387949070
• ISBN 13: 9780387949079
• Rilegatura: Copertina rigida
• Numero edizione: 1
• Numero di pagine: 400