This is an introduction for undergraduates to the theory of computation which emphasizes formal languages, automata, and abstract models of computation and computability. It also includes an introduction to computational complexity and NP-completeness. Key features of the book includes: numerous examples and informal discussions; extended discussion of mathematical induction; an introduction to computational complexity; and inclusion of Ogden's Lemma.
"synopsis" may belong to another edition of this title.
Numerous examples and informal discussions.
Extended discussion of mathematical induction, including recursive definitions and structural induction
Improved introduction to computational complexity.
Inclusion of Ogden's Lemma.
"About this title" may belong to another edition of this title.
£ 3.35 shipping within United Kingdom
Destination, rates & speedsSeller: New Book Sale, London, United Kingdom
Paperback. Condition: New. Usually Dispatched within 1-2 Business Days , Buy with confidence , excellent customer service. Seller Inventory # 007115468x--35
Quantity: 1 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: Used. pp. 512. Seller Inventory # 44774695
Quantity: 1 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: Used. pp. 512 1st Edition. Seller Inventory # 2648007928
Quantity: 1 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: Used. pp. 512. Seller Inventory # 1848007922
Quantity: 1 available
Seller: Studibuch, Stuttgart, Germany
paperback. Condition: Befriedigend. 512 Seiten; 9780071154680.4 Gewicht in Gramm: 1. Seller Inventory # 878234
Quantity: 1 available