Introduction to languages and the theory of computation / John C. Martin.
Material type:
TextPublisher: New York, NY : McGraw-Hill, 2011Edition: Fourth editionDescription: xii, 436 pages : illustrations ; 24 cmContent type: - text
- unmediated
- volume
- 9780071289429
- 9780071289429
- 9780071289429
- 0071289429
- QA 267.5 MAR
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Books | GHU Library | QA 267.5 MAR (Browse shelf(Opens below)) | Available | GHU3261860214 |
Browsing GHU Library shelves Close shelf browser (Hides shelf browser)
| QA154.2. L522 LIA College algebra and trigonometry / | QA154.2. L522 LIA College algebra and trigonometry / | QA267 LEW Elements of the theory of computation / | QA 267.5 MAR Introduction to languages and the theory of computation / | QA268 GCH The GCHQ Puzzle Book II. | QA268 GCH The GCHQ Puzzle Book II. | QA268 HAR Applied algebra : codes, ciphers, and discrete algorithms / |
Includes bibliographical references (pages 425-426) and index.
Mathematical tools and techniques -- Finite automata and the languages they accept -- Regular expressions, nondeterminism, and Kleene's Theorem -- Context-free languages -- Pushdown automata -- Context-free and con-context-free languages -- Turing machines -- Recursively enumerable languages -- Undecidable problems -- Computable functions -- Introduction to computational complexity.
There are no comments on this title.