Verwandte Artikel zu Automata and Computability (Undergraduate Texts in...
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Von der hinteren Coverseite
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Automata and Computability (Undergraduate Texts in...
Beispielbild für diese ISBN
Automata and Computability
Verlag:
Springer-Verlag New York Inc., 1997
ISBN 10: 0387949070
ISBN 13: 9780387949079
Gebraucht
Hardcover
Anbieter: World of Books (was SecondSale), Montgomery, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: Fair. 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. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. Artikel-Nr. 00108291851
Gebraucht kaufen
EUR 13,59
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Automata and Computability (Undergraduate Texts in Computer Science)
Verlag:
Springer (edition 1997), 1997
ISBN 10: 0387949070
ISBN 13: 9780387949079
Gebraucht
Hardcover
Anbieter: BooksRun, Philadelphia, PA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Fair. 1997. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way. Artikel-Nr. 0387949070-7-1
Gebraucht kaufen
EUR 13,60
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Automata and Computability
Anbieter: WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Artikel-Nr. GOR003375305
Gebraucht kaufen
EUR 71,96
EUR 6,53 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Automata and Computability (Undergraduate Texts in Computer Science)
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 400 pages. 9.75x7.50x1.25 inches. In Stock. Artikel-Nr. x-0387949070
Neu kaufen
EUR 133,81
EUR 14,57 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Automata and Computability
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. 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. Artikel-Nr. 9780387949079
Neu kaufen
EUR 124,52
EUR 35,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar