Anbieter: Books From California, Simi Valley, CA, USA
paperback. Zustand: Good. Cover shows minor shelf wear. Pages are clean, text and pictures are intact and unmarred.
Anbieter: Dream Books Co., Denver, CO, USA
Zustand: good. Gently used with minimal wear on the corners and cover. A few pages may contain light highlighting or writing, but the text remains fully legible. Dust jacket may be missing, and supplemental materials like CDs or codes may not be included. May be ex-library with library markings. Ships promptly!
EUR 14,10
Anzahl: 2 verfügbar
In den WarenkorbZustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Anbieter: Books From California, Simi Valley, CA, USA
paperback. Zustand: Very Good.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 60,65
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In English.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 101,56
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. reprint edition. 400 pages. 8.75x6.00x1.00 inches. In Stock.
Taschenbuch. Zustand: Neu. Automata and Computability | Dexter C. Kozen | Taschenbuch | Undergraduate Texts in Computer Science | xiii | Englisch | 2012 | Springer | EAN 9781461273097 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.