Normal view MARC view ISBD view

Theory of Computer Science: Automata, Languages and Computation

By: Mishra, K.L.P.
Contributor(s): Chandrasekaran, N.
Material type: materialTypeLabelBookPublisher: New Delhi Prentice-Hall of India 1998Edition: 2nd ed.Description: xi, 304p.ISBN: 9788120312715; 8120312716.Subject(s): Computer ScienceDDC classification: 004
Contents:
Preface. Notations. 1. Propositions and Predicates. 2. Mathematical Preliminaries. 3. The Theory of Automata. 4. Formal Languages. 5. Regular Sets and Regular Grammars. 6. Context-Free Languages. 7. Pushdown Automata. 8. LR(k) Grammars. 9. Turing Machines and Linear Bounded Automata. 10. Decidability and Recursively Enumerable Languages. 11. Computability. 12. Complexity. Answers to Self-Tests. Solutions (or Hints) to Chapter-end Exercises. Further Reading. Index.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode
General Book General Book Nava Nalanda Central Library
General Section
GEN 004 MI-T (Browse shelf) Checked out 06/10/2017 171717
General Book General Book Nava Nalanda Central Library
General Section
GEN 004 MI-T (Browse shelf) Checked out 20/10/2017 73976
General Book General Book Nava Nalanda Central Library
General Section
GEN 004 MI-T (Browse shelf) Checked out 23/10/2017 72701

Preface. Notations. 1. Propositions and Predicates. 2. Mathematical Preliminaries. 3. The Theory of Automata. 4. Formal Languages. 5. Regular Sets and Regular Grammars. 6. Context-Free Languages. 7. Pushdown Automata. 8. LR(k) Grammars. 9. Turing Machines and Linear Bounded Automata. 10. Decidability and Recursively Enumerable Languages. 11. Computability. 12. Complexity. Answers to Self-Tests. Solutions (or Hints) to Chapter-end Exercises. Further Reading. Index.

There are no comments for this item.

Log in to your account to post a comment.