000			01500 a2200205 4500
008			180623b c1997 xxu||||| |||| 00| 0 eng d
020			_a9781461273097
082			_a511.3 _bKOZ
100			_aKozen, Dexter C.
245			_aAutomata and computability
260			_bSpringer, _c1997. _aNew York:
300			_axiii, 400p.; _c24 cm.
365			_aINR _b4826.20
440			_a Undergraduate texts in computer science
500			_aIncludes bibliographical references and index.
520			_aThe 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.
650			_aMachine theory.
650			_aComputable functions.
942			_2ddc _cTD
999			_c47934 _d47934