Articoli correlati a Automata and Computability
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
Introduction * Finite Automata and Regular Sets * Pushdown Automata and Context-Free Languages * Turing Machines and Effective Computability * Homework Sets * Miscellaneous Exercises * Hints and Solutions
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 47,23
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Automata and Computability
Foto dell'editore
Automata and Computability (Undergraduate Texts in Computer Science)
Da: Books From California, Simi Valley, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
paperback. Condizione: Very Good. Codice articolo mon0003649726
Quantità: 1 disponibili
Foto dell'editore
Automata and Computability (Undergraduate Texts in Computer Science)
Da: Books From California, Simi Valley, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
paperback. Condizione: Good. Cover shows minor shelf wear. Pages are clean, text and pictures are intact and unmarred. Codice articolo mon0003645816
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata and Computability
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Codice articolo 19494116-5
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata and Computability
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 4189933
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Automata and Computability
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Codice articolo 19494116-5
Quantità: 1 disponibili
Immagini fornite dal venditore
Automata and Computability
Editore:
Springer New York Okt 2012, 2012
ISBN 10: 1461273099
ISBN 13: 9781461273097
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461273097
Quantità: 2 disponibili
Foto dell'editore
Automata and Computability (Undergraduate Texts in Computer Science)
Da: Toscana Books, AUSTIN, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Codice articolo Scanned1461273099
Quantità: 1 disponibili
Foto dell'editore
Automata and Computability (Undergraduate Texts in Computer Science)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9781461273097
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Automata and Computability
Editore:
Springer New York, Springer US Okt 2012, 2012
ISBN 10: 1461273099
ISBN 13: 9781461273097
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461273097
Quantità: 2 disponibili
Immagini fornite dal venditore
Automata and Computability
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 19494116-n
Quantità: Più di 20 disponibili