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.
"synopsis" may belong to another edition of this title.
Shipping:
US$ 4.25
Within U.S.A.
Book Description Hardcover. Condition: new. New Copy. Customer Service Guaranteed. Seller Inventory # think0387949070
Book Description Hardcover. Condition: new. New. Fast Shipping and good customer service. Seller Inventory # Holz_New_0387949070
Book Description Condition: new. Seller Inventory # newMercantile_0387949070
Book Description Hardcover. Condition: New. Ships in a BOX from Central Missouri! UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 000329085N
Book Description Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Seller Inventory # Scanned0387949070
Book Description Condition: new. Seller Inventory # FrontCover0387949070
Book Description Condition: New. New. In shrink wrap. Looks like an interesting title! 2.04. Seller Inventory # Q-0387949070
Book Description Hardcover. Condition: new. Seller Inventory # 9780387949079
Book Description Condition: New. Seller Inventory # 671842-n
Book Description hardback. Condition: New. Language: ENG. Seller Inventory # 9780387949079