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

By: Martin, John CMaterial type: TextTextPublication 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.3
Contents:
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.
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 Call number Status Date due Barcode Item holds
Books Books Namal Library
Mathematics 		511.3 MAR-I 2012 3721 (Browse shelf (Opens below)) Available 0003721
Total holds: 0

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.

to post a comment.