Category
Algorithms & data structures
Store
Wordery
Brand
Springer new york
Automata and Computability : Springer : 9781461273097 : 1461273099 : 13 Oct 2012 : 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.
44.99 GBP
Recommendations
Choose your language and region
Klarna is available around the world with a variable offering, choose one that suits you best.
Copyright © 2005-2024 Klarna Bank AB (publ). Headquarters: Stockholm, Sweden. All rights reserved. Klarna Bank AB (publ). Sveavägen 46, 111 34 Stockholm. Organization number: 556737-0431