Amazon cover image
Image from Amazon.com

Introduction to automata theory, languages, and computation / John E. Hopcroft and Jeffrey D. Ullman.

By: Contributor(s): Material type: TextTextPublication details: Massachusetts : Addision-Wesley Publishing Company, c1979Description: x, 411 pages ; 21 cmISBN:
  • 9780201029888
Subject(s): LOC classification:
  • QA 237 .H67 1979
Contents:
Chapter 1. Preliminaries -- Chapter 2. Finite automata and regular expressions -- Chapter 3. Properties of regular sets -- Chapter 4. Context-free grammar -- Chapter 5. Pushdown automata -- Chapter 6. Properties of context-free languages -- Chapter 7. Turing machines -- Chapter 8. Undecidability -- Chapter 9. The chomsky hierarchy -- Chapter 10. Deterministic context-free languages -- Chapter 11. Closure properties of families of languages -- Chapter 12. Computational complexity theory -- Chapter 13. Intractable problems -- Chapter 14. Highlights of other important language classes.
Summary: Ten years ago the authors undertook to produce a book converting the known material on formal languages, automata theory, and computational complexity.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Annex Relegation Room Secondary Education - Mathematics GC QA 237 .H67 1979 (Browse shelf(Opens below)) c.1 Available NULIB000002629

Includes bibliographical references and index.

Chapter 1. Preliminaries -- Chapter 2. Finite automata and regular expressions -- Chapter 3. Properties of regular sets -- Chapter 4. Context-free grammar -- Chapter 5. Pushdown automata -- Chapter 6. Properties of context-free languages -- Chapter 7. Turing machines -- Chapter 8. Undecidability -- Chapter 9. The chomsky hierarchy -- Chapter 10. Deterministic context-free languages -- Chapter 11. Closure properties of families of languages -- Chapter 12. Computational complexity theory -- Chapter 13. Intractable problems -- Chapter 14. Highlights of other important language classes.

Ten years ago the authors undertook to produce a book converting the known material on formal languages, automata theory, and computational complexity.

There are no comments on this title.

to post a comment.