Articles liés à Automata and Computability
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 47,23
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Automata and Computability
Image d'archives
Automata and Computability
Edité par
Springer New York, 2012
ISBN 10 : 1461273099
ISBN 13 : 9781461273097
Ancien ou d'occasion
Couverture souple
Vendeur : Better World Books Ltd, Dunfermline, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. N° de réf. du vendeur 45928676-20
Quantité disponible : 3 disponible(s)
Image d'archives
Automata and Computability (Undergraduate Texts in Computer Science)
Edité par
Springer, 2012
ISBN 10 : 1461273099
ISBN 13 : 9781461273097
Ancien ou d'occasion
paperback
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
paperback. Etat : Good. Cover shows minor wear. Pages are clean, text and pictures are intact and unmarred. N° de réf. du vendeur mon0003645984
Quantité disponible : 1 disponible(s)
Image d'archives
Automata and Computability (Undergraduate Texts in Computer Science)
Edité par
Springer, 2012
ISBN 10 : 1461273099
ISBN 13 : 9781461273097
Ancien ou d'occasion
paperback
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
paperback. Etat : Very Good. N° de réf. du vendeur mon0003649726
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata and Computability
Edité par
Springer New York, 2012
ISBN 10 : 1461273099
ISBN 13 : 9781461273097
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Introduction to the basic theoretical models of computability, providing students who have already some experience with elementary discrete mathematics with a well-paced first courseA number of supplementary chapters introduce more advanced concep. N° de réf. du vendeur 4189933
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Automata and Computability
Edité par
Springer New York Okt 2012, 2012
ISBN 10 : 1461273099
ISBN 13 : 9781461273097
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 420 pp. Englisch. N° de réf. du vendeur 9781461273097
Quantité disponible : 2 disponible(s)
Image d'archives
Automata and Computability (Undergraduate Texts in Computer Science)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In English. N° de réf. du vendeur ria9781461273097_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Automata and Computability (Undergraduate Texts in Computer Science)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9781461273097
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Automata and Computability
Edité par
Springer New York, Springer US Okt 2012, 2012
ISBN 10 : 1461273099
ISBN 13 : 9781461273097
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9781461273097
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Automata and Computability
Edité par
Springer New York, Springer US, 2012
ISBN 10 : 1461273099
ISBN 13 : 9781461273097
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9781461273097
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata and Computability
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 19494116-n
Quantité disponible : Plus de 20 disponibles