Advertisement

Automata and Computability

  • Dexter C. Kozen

Part of the Undergraduate Texts in Computer Science book series (UTCS)

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Lectures

    1. Front Matter
      Pages 1-1
    2. Dexter C. Kozen
      Pages 3-6
    3. Dexter C. Kozen
      Pages 7-13
    4. Dexter C. Kozen
      Pages 14-18
    5. Dexter C. Kozen
      Pages 19-24
    6. Dexter C. Kozen
      Pages 25-31
    7. Dexter C. Kozen
      Pages 32-39
    8. Dexter C. Kozen
      Pages 40-43
    9. Dexter C. Kozen
      Pages 44-48
    10. Dexter C. Kozen
      Pages 49-54
    11. Dexter C. Kozen
      Pages 55-60
    12. Dexter C. Kozen
      Pages 61-66
    13. Dexter C. Kozen
      Pages 67-71
    14. Dexter C. Kozen
      Pages 72-76
    15. Dexter C. Kozen
      Pages 77-83
    16. Dexter C. Kozen
      Pages 84-88
    17. Dexter C. Kozen
      Pages 89-94
    18. Dexter C. Kozen
      Pages 95-99
    19. Dexter C. Kozen
      Pages 100-107
    20. Dexter C. Kozen
      Pages 108-113
    21. Dexter C. Kozen
      Pages 114-118
    22. Dexter C. Kozen
      Pages 119-123
    23. Dexter C. Kozen
      Pages 124-128
    24. Dexter C. Kozen
      Pages 129-134
    25. Dexter C. Kozen
      Pages 135-139
    26. Dexter C. Kozen
      Pages 140-147
    27. Dexter C. Kozen
      Pages 148-156
    28. Dexter C. Kozen
      Pages 157-163
    29. Dexter C. Kozen
      Pages 164-166
    30. Dexter C. Kozen
      Pages 167-171
    31. Dexter C. Kozen
      Pages 172-175
    32. Dexter C. Kozen
      Pages 176-180
    33. Dexter C. Kozen
      Pages 181-190
    34. Dexter C. Kozen
      Pages 191-197
    35. Dexter C. Kozen
      Pages 198-200
    36. Dexter C. Kozen
      Pages 201-205
    37. Dexter C. Kozen
      Pages 206-214
    38. Dexter C. Kozen
      Pages 215-220
    39. Dexter C. Kozen
      Pages 221-227
    40. Dexter C. Kozen
      Pages 228-234
    41. Dexter C. Kozen
      Pages 235-238
    42. Dexter C. Kozen
      Pages 239-244
    43. Dexter C. Kozen
      Pages 245-248
    44. Dexter C. Kozen
      Pages 249-255
    45. Dexter C. Kozen
      Pages 256-261
    46. Dexter C. Kozen
      Pages 262-268
    47. Dexter C. Kozen
      Pages 269-273
    48. Dexter C. Kozen
      Pages 274-281
    49. Dexter C. Kozen
      Pages 282-286

About this book

Introduction

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.

Keywords

Notation Turing machine algorithm algorithms automata computability grammars regular expressions

Authors and affiliations

  • Dexter C. Kozen
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4612-1844-9
  • Copyright Information Springer Science+Business Media, Inc. 1997
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-7309-7
  • Online ISBN 978-1-4612-1844-9
  • Buy this book on publisher's site