Pulse en una miniatura para ir a Google Books.
Cargando... Automata and Computabilitypor Dexter C. Kozen
Ninguno Cargando...
Inscríbete en LibraryThing para averiguar si este libro te gustará. Actualmente no hay Conversaciones sobre este libro. Este libro provee una introducción a los modelos teóricos de la computabilidad y algunos desarrollos vinculados a ellos, como así también una variedad de estructuras de las matemáticas discretas. sin reseñas | añadir una reseña
Pertenece a las series
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. No se han encontrado descripciones de biblioteca. |
Debates activosNinguno
Google Books — Cargando... GénerosSistema Decimal Melvil (DDC)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicClasificación de la Biblioteca del CongresoValoraciónPromedio:
¿Eres tú?Conviértete en un Autor de LibraryThing. |