Amazon cover image
Image from Amazon.com

Introduction to languages and the theory of computation / John C. Martin

By: Material type: TextTextPublication details: New York : McGraw Hill Education, c2011Edition: Fourth EditionDescription: xii, 436 pages ; 24 cmISBN:
  • 9780073191461
Subject(s): LOC classification:
  • QA 267.5.S4 .M37 2011
Contents:
Chapter 1. Mathematical tools and techniques -- Chapter 2. Finite automata and the language they accept -- Chapter 3. Regular expressions, nondeterminism, and Kleene's theorem -- chapter 4. Context-free languages -- Chapter 5. Pushdown automata -- Chapter 6. Context-free and non-context-free languages -- Chapter 7. Turing machines -- Chapter 8. Recursively enumerable languages -- Chapter 9. Undecidable problems -- Chapter 10. Computable functions -- Chapter 11. Introduction to computational complexity.
Summary: This book is an introduction to the theory of computation.
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 - Graduate Studies General Circulation Gen. Ed. - CCIT GC QA 267.5.S4 .M37 2011 (Browse shelf(Opens below)) c.1 Available NULIB000009212
Browsing LRC - Graduate Studies shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)
GC QA 76.774 .D47 2015 The design and implementation of the freeBSD operating system / GC QA 267.3 .L56 2012 An introduction to formal languages and automata / GC QA 267.3 .N34 2011 c.2 Formal languages and automata theory / GC QA 267.5.S4 .M37 2011 Introduction to languages and the theory of computation / GC QA 267 .A34 2010 Theory of computation / GC QA 267 .K85 2013 Theory of computation / GC QA 267 .S57 2013 Introduction to the theory of computation /

Includes bibliographical references and index.

Chapter 1. Mathematical tools and techniques -- Chapter 2. Finite automata and the language they accept -- Chapter 3. Regular expressions, nondeterminism, and Kleene's theorem -- chapter 4. Context-free languages -- Chapter 5. Pushdown automata -- Chapter 6. Context-free and non-context-free languages -- Chapter 7. Turing machines -- Chapter 8. Recursively enumerable languages -- Chapter 9. Undecidable problems -- Chapter 10. Computable functions -- Chapter 11. Introduction to computational complexity.

This book is an introduction to the theory of computation.

There are no comments on this title.

to post a comment.