Automata and Computability
Kozen, Dexter C.
From WorldofBooks, Goring-By-Sea, WS, United Kingdom
AbeBooks Seller Since March 16, 2007
Quantity: 1From WorldofBooks, Goring-By-Sea, WS, United Kingdom
AbeBooks Seller Since March 16, 2007
Quantity: 1About this Item
The book has been read but remains in clean condition. All pages are intact and the cover is intact. Some minor wear to the spine. Seller Inventory # GOR009733571
Bibliographic Details
Title: Automata and Computability
Publisher: Springer
Publication Date: 1997
Binding: Hardback
Condition: Good
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
WorldofBooks.com fully embraces the AbeBooks terms and conditions and we will do
what we can to resolve any issues.
Orders ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.
Payment Methods
accepted by seller