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 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. The first part of the book is devoted to finite automata and their properties. Then, material on pushdown automata provides a broader class of models and enables 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.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 60,55
EUR 13,86 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Automata and Computability (Undergraduate Texts in...
Beispielbild für diese ISBN
Automata and Computability
Anbieter: Better World Books Ltd, Dunfermline, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Artikel-Nr. 45928676-20
Anzahl: 3 verfügbar
Beispielbild für diese ISBN
Automata and Computability (Undergraduate Texts in Computer Science)
Anbieter: Books From California, Simi Valley, CA, USA
Verkäuferbewertung 5 von 5 Sternen
paperback. Zustand: Very Good. Artikel-Nr. mon0003649726
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Automata and Computability (Undergraduate Texts in Computer Science)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In English. Artikel-Nr. ria9781461273097_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Automata & Computability (Undergraduate Texts in Compute)
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. reprint edition. 400 pages. 8.75x6.00x1.00 inches. In Stock. Artikel-Nr. x-1461273099
Anzahl: 2 verfügbar
Foto des Verkäufers
Automata and Computability
Verlag:
Springer New York, Springer US Okt 2012, 2012
ISBN 10: 1461273099
ISBN 13: 9781461273097
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 420 pp. Englisch. Artikel-Nr. 9781461273097
Anzahl: 2 verfügbar
Foto des Verkäufers
Automata and Computability
Verlag:
Springer New York, Springer US, 2012
ISBN 10: 1461273099
ISBN 13: 9781461273097
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Artikel-Nr. 9781461273097
Anzahl: 1 verfügbar