Skip to main content
SpringerLink
Log in

Automata and Computability

  • Textbook
  • © 1977

Overview

Authors:
  1. Dexter C. Kozen

    1. Department of Computer Science, Cornell University, Ithaca, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (67 chapters)

  1. Lectures

    1. Finite Automata and Regular Sets

      1. Automata on Terms
        • Dexter C. Kozen
        Pages 108-113
      2. The Myhill—Nerode Theorem for Term Automata
        • Dexter C. Kozen
        Pages 114-118
      3. Two-Way Finite Automata
        • Dexter C. Kozen
        Pages 119-123
      4. 2DFAs and Regular Sets
        • Dexter C. Kozen
        Pages 124-128

    2. Pushdown Automata and Context-Free Languages

      1. Context-Free Grammars and Languages
        • Dexter C. Kozen
        Pages 129-134
      2. Balanced Parentheses
        • Dexter C. Kozen
        Pages 135-139
      3. Normal Forms
        • Dexter C. Kozen
        Pages 140-147
      4. The Pumping Lemma for CFLs
        • Dexter C. Kozen
        Pages 148-156
      5. Pushdown Automata
        • Dexter C. Kozen
        Pages 157-163
      6. Final State Versus Empty Stack
        • Dexter C. Kozen
        Pages 164-166
      7. PDAs and CFGs
        • Dexter C. Kozen
        Pages 167-171
      8. Simulating NPDAs by CFGs
        • Dexter C. Kozen
        Pages 172-175
      9. Deterministic Pushdown Automata
        • Dexter C. Kozen
        Pages 176-180
      10. Parsing
        • Dexter C. Kozen
        Pages 181-190
      11. The Cocke—Kasami—Younger Algorithm
        • Dexter C. Kozen
        Pages 191-197
      12. The Chomsky—Schützenberger Theorem
        • Dexter C. Kozen
        Pages 198-200
      13. Parikh’s Theorem
        • Dexter C. Kozen
        Pages 201-205

    3. Turing Machines and Effective Computability

      1. Turing Machines and Effective Computability
        • Dexter C. Kozen
        Pages 206-214
      2. More on Turing Machines
        • Dexter C. Kozen
        Pages 215-220
      3. Equivalent Models
        • Dexter C. Kozen
        Pages 221-225
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Department of Computer Science, Cornell University, Ithaca, USA

    Dexter C. Kozen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation