About this Item
This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In poor condition, suitable as a reading copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:9780387949079. Seller Inventory # 9048632
Bibliographic Details
Title: Automata and Computability
Publisher: Springer
Publication Date: 1997
Binding: Hardcover
Condition: Poor
About this title
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.
"About this title" may belong to another edition of this title.
Store Description
Anybook Ltd is a company registered in England and Wales. Company Registration Number: 3692291. VAT Number: GB753406145. Share Capital GBP100.
Registered Offices:
28 West End,
Burgh le Marsh,
Lincolnshire,
PE24 5EY
UK
Customer Services:
2,Outer Circle Business Park,
Outer Circle Road,
Lincoln
LN2 4HX
UK
Email Address: sales@anybook.com
Telephone Number: +44 (0) 1522 519 991
Authorized Representative: Ms. Claire Williams
Orders usually ship within 1 business day. We use Royal Mail and other reputable couriers at greatly discounted postage rates. If your book order is heavy or over-sized, we may contact you to let you know extra shipping is required.
Payment Methods
accepted by seller