Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
Students who already have some experience with elementary discrete mathematics will find this a well-paced first course in automata and computability.
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop their understanding of some of the model's rich and varied structure.
As well as comprehensive coverage of the essentials of the subject, a number of supplementary chapters introduce more advanced concepts, enabling students to broaden their knowledge of the subject.
The first part of the book is devoted to finite automata and their properties. Then, material on pushdown automata provides analysis of a broader class of models and enables the analysis of context-free languages.
In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems.
Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.