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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Seller: BooksRun, Philadelphia, PA, U.S.A.
Hardcover. Condition: Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Seller Inventory # 0387949070-11-1
Seller: Zoom Books Company, Lynden, WA, U.S.A.
Condition: very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. Seller Inventory # ZBV.0387949070.VG
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0387949070I3N00
Seller: GoldBooks, Denver, CO, U.S.A.
Hardcover. Condition: new. New Copy. Customer Service Guaranteed. Seller Inventory # 97J90_83_0387949070
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Hardback. Condition: 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. Seller Inventory # GOR003375305
Quantity: 1 available
Seller: eCampus, Lexington, KY, U.S.A.
Condition: New. Seller Inventory # N:9780387949079:ONHAND
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 671842-n
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0387949070
Seller: SHIMEDIA, Brooklyn, NY, U.S.A.
Condition: New. Satisfaction Guaranteed or your money back. Seller Inventory # 0387949070
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. Hardcover. 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 Godel'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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780387949079