Automata and computability
Series: Undergraduate texts in computer sciencePublication details: Springer, 1997. New York:Description: xiii, 400p.; 24 cmISBN:- 9781461273097
- 511.3 KOZ
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
![]() |
IIT Gandhinagar General Stacks | General | 511.3 KOZ (Browse shelf(Opens below)) | Available | 026295 |
Browsing IIT Gandhinagar shelves, Shelving location: General Stacks, Collection: General Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
511.3 BER Categories and modules: with K-theory in view | 511.3 HAL Logic as algebra | 511.3 JEC Axiom of choice | 511.3 KOZ Automata and computability | 511.3 PUD Logical foundations of mathematics and computational complexity: a gentle introduction | 511.3 TOU Lectures in logic and set theory: mathematical Logic , Vol.1 | 511.3 TOU Lectures in logic and set theory: set theory, Vol. 2 |
Includes bibliographical references and index.
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. 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 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.
There are no comments on this title.