Automata and Computability
Kozen, Dexter C.
Verkauft von WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
AbeBooks-Verkäufer seit 16. März 2007
Gebraucht - Hardcover
Zustand: Very Good
Anzahl: 1 verfügbar
In den Warenkorb legenVerkauft von WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
AbeBooks-Verkäufer seit 16. März 2007
Zustand: Very Good
Anzahl: 1 verfügbar
In den Warenkorb legenThe book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
Bestandsnummer des Verkäufers GOR003375305
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.