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. Introduction

      1. Dexter C. Kozen
        Pages 3-6
      2. Dexter C. Kozen
        Pages 7-13
    3. Finite Automata and Regular Sets

      1. Dexter C. Kozen
        Pages 14-18
      2. Dexter C. Kozen
        Pages 19-24
      3. Dexter C. Kozen
        Pages 25-31
      4. Dexter C. Kozen
        Pages 32-39
      5. Dexter C. Kozen
        Pages 40-43
      6. Dexter C. Kozen
        Pages 44-48
      7. Dexter C. Kozen
        Pages 49-54
      8. Dexter C. Kozen
        Pages 55-60
      9. Dexter C. Kozen
        Pages 61-66
      10. Dexter C. Kozen
        Pages 67-71
      11. Dexter C. Kozen
        Pages 72-76
      12. Dexter C. Kozen
        Pages 77-83
      13. Dexter C. Kozen
        Pages 84-88
      14. Dexter C. Kozen
        Pages 89-94
      15. Dexter C. Kozen
        Pages 95-99
      16. Dexter C. Kozen
        Pages 100-107
      17. Dexter C. Kozen
        Pages 108-113
      18. Dexter C. Kozen
        Pages 114-118
      19. Dexter C. Kozen
        Pages 119-123
      20. Dexter C. Kozen
        Pages 124-128
    4. Pushdown Automata and Context-Free Languages

      1. Dexter C. Kozen
        Pages 129-134
      2. Dexter C. Kozen
        Pages 135-139
      3. Dexter C. Kozen
        Pages 140-147
      4. Dexter C. Kozen
        Pages 148-156
      5. Dexter C. Kozen
        Pages 157-163
      6. Dexter C. Kozen
        Pages 164-166
      7. Dexter C. Kozen
        Pages 167-171
      8. Dexter C. Kozen
        Pages 172-175
      9. Dexter C. Kozen
        Pages 176-180
      10. Dexter C. Kozen
        Pages 181-190
      11. Dexter C. Kozen
        Pages 191-197
      12. Dexter C. Kozen
        Pages 198-200
      13. Dexter C. Kozen
        Pages 201-205
    5. Turing Machines and Effective Computability

      1. Dexter C. Kozen
        Pages 206-214
      2. Dexter C. Kozen
        Pages 215-220
      3. Dexter C. Kozen
        Pages 221-225
      4. Dexter C. Kozen
        Pages 228-233
      5. Dexter C. Kozen
        Pages 235-238
      6. Dexter C. Kozen
        Pages 239-244
      7. Dexter C. Kozen
        Pages 245-248
      8. Dexter C. Kozen
        Pages 249-255
      9. Dexter C. Kozen
        Pages 256-261
      10. Dexter C. Kozen
        Pages 262-268
      11. Dexter C. Kozen
        Pages 269-273
      12. Dexter C. Kozen
        Pages 274-281
      13. Dexter C. Kozen
        Pages 282-286

About this book

Introduction

These are my lecture notes from CS381/481: Automata and Computability Theory, a one-semester senior-level course I have taught at Cornell Uni­ versity for many years. I took this course myself in thc fall of 1974 as a first-year Ph.D. student at Cornell from Juris Hartmanis and have been in love with the subject ever sin,:e. The course is required for computer science majors at Cornell. It exists in two forms: CS481, an honors version; and CS381, a somewhat gentler­ paced version. The syllabus is roughly the same, but CS481 go es deeper into thc subject, covers more material, and is taught at a more abstract level. Students are encouraged to start off in one or the other, then switch within the first few weeks if they find the other version more suitaLle to their level of mathematical skill. The purpose of t.hc course is twofold: to introduce computer science students to the rieh heritage of models and abstractions that have arisen over the years; and to dew!c'p the capacity to form abstractions of their own and reason in terms of them.

Keywords

Abstraction Mathematica Notation Turing machine algorithms automata computability computability theory computer computer science eXist form grammar switch

Authors and affiliations

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

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-85706-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 1977
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-85708-9
  • Online ISBN 978-3-642-85706-5
  • Buy this book on publisher's site