Introduction to languages and the theory of computation / by John C. Martin.
Material type: TextPublication details: New Delhi : McGraw-Hill, c2013Edition: 3rd edDescription: v, 543 p. : ill. ; 24 cmISBN: 9780070660489(pbk); 0070660484(pbk)Subject(s): Sequential machine theory | Computable functionsDDC classification: 511.3Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Books | Namal Library Mathematics | 511.3 MAR-I 2012 3721 (Browse shelf (Opens below)) | Available | 0003721 |
Browsing Namal Library shelves, Shelving location: Mathematics Close shelf browser (Hides shelf browser)
511.3 LEA-S 2002 12115 The structure of proof : with logic and set theory / | 511.3 LIN-I 2001 871 An introduction to formal languages and automata / | 511.3 LOD-P 2009 4616 Perspectives in concurrency theory : | 511.3 MAR-I 2012 3721 Introduction to languages and the theory of computation / | 511.3 MAZ-E 2006 12989 Euclid in the rainforest : discovering the universal truth in logic and math / | 511.3 NAG-G 2001 10644 Gödel's proof / | 511.3 PON-M 2019 10826 Mathematical maturity via discrete mathematics/ |
Includes bibliographical references (p. 529-530) and indexes.
Pt. I. Mathematical Notation and Techniques -- Ch. 1. Basic Mathematical Objects -- Ch. 2. Mathematical Induction and Recursive Definitions -- Pt. II. Regular Languages and Finite Automata -- Ch. 3. Regular Expressions and Finite Automata -- Ch. 4. Nondeterminism and Kleene's Theorem -- Ch. 5. Regular and Nonregular Languages -- Pt. III. Context-Free Languages and Pushdown Automata -- Ch. 6. Context-Free Grammars -- Ch. 7. Pushdown Automata -- Ch. 8. Context-Free and Non-Context-Free Languages -- Pt. IV. Turing Machines and Their Languages -- Ch. 9. Turing Machines -- Ch. 10. Recursively Enumerable Languages -- Pt. V. Unsolvable Problems and Computable Functions -- Ch. 11. Unsolvable Problems -- Ch. 12. Computable Functions -- Pt. VI. Introduction to Computational Complexity -- Ch. 13. Measuring and Classifying Complexity -- Ch. 14. Tractable and Intractable Problems.
There are no comments on this title.