Skip to main content
Book cover
  • Textbook
  • © 1997

Automata and Computability

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)

Sections

eBook USD 44.99
Price excludes VAT (USA)
  • ISBN: 978-1-4612-1844-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 59.99
Price excludes VAT (USA)
Hardcover Book USD 89.99
Price excludes VAT (USA)
Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (50 chapters)

  1. Front Matter

    Pages i-xiii
    PDF

  2. Lectures

    1. Front Matter

      Pages 1-1
      PDF

    2. Course Roadmap and Historical Perspective

      • Dexter C. Kozen
      Pages 3-6

    3. Strings and Sets

      • Dexter C. Kozen
      Pages 7-13

    4. Finite Automata and Regular Sets

      • Dexter C. Kozen
      Pages 14-18

    5. More on Regular Sets

      • Dexter C. Kozen
      Pages 19-24

    6. Nondeterministic Finite Automata

      • Dexter C. Kozen
      Pages 25-31

    7. The Subset Construction

      • Dexter C. Kozen
      Pages 32-39

    8. Pattern Matching

      • Dexter C. Kozen
      Pages 40-43

    9. Pattern Matching and Regular Expressions

      • Dexter C. Kozen
      Pages 44-48

    10. Regular Expressions and Finite Automata

      • Dexter C. Kozen
      Pages 49-54

    11. Kleene Algebra and Regular Expressions

      • Dexter C. Kozen
      Pages 55-60

    12. Homomorphisms

      • Dexter C. Kozen
      Pages 61-66

    13. Limitations of Finite Automata

      • Dexter C. Kozen
      Pages 67-71

    14. Using the Pumping Lemma

      • Dexter C. Kozen
      Pages 72-76

    15. DFA State Minimization

      • Dexter C. Kozen
      Pages 77-83

    16. A Minimization Algorithm

      • Dexter C. Kozen
      Pages 84-88

    17. Myhill—Nerode Relations

      • Dexter C. Kozen
      Pages 89-94

    18. The Myhill—Nerode Theorem

      • Dexter C. Kozen
      Pages 95-99

    19. Collapsing Nondeterministic Automata

      • Dexter C. Kozen
      Pages 100-107
Back to top

About this book

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.
Back to top

Keywords

  • Notation
  • Turing machine
  • algorithm
  • algorithms
  • automata
  • computability
  • grammars
  • regular expressions
  • algorithm analysis and problem complexity
Back to top

Authors and Affiliations

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

    Dexter C. Kozen

Back to top

Bibliographic Information

  • Book Title: Automata and Computability

  • Authors: Dexter C. Kozen

  • Series Title: Undergraduate Texts in Computer Science

  • DOI: https://doi.org/10.1007/978-1-4612-1844-9

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1997

  • Hardcover ISBN: 978-0-387-94907-9Published: 30 April 1997

  • Softcover ISBN: 978-1-4612-7309-7Published: 13 October 2012

  • eBook ISBN: 978-1-4612-1844-9Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: XIII, 400

  • Topics: Theory of Computation, Algorithms

Back to top
Access via your institution
eBook USD 44.99
Price excludes VAT (USA)
  • ISBN: 978-1-4612-1844-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 59.99
Price excludes VAT (USA)
Hardcover Book USD 89.99
Price excludes VAT (USA)
Learn about institutional subscriptions