Introduction to languages and the theory of computation / John C. Martin.
Material type:
TextPublication details: Boston : McGraw-Hill, c2003.Edition: 3rd edDescription: xiii, 543 p. : ill. ; 24 cmISBN: - 0072322004 (alk. paper)
- 0071198547 (International ed. : alk. paper)
- 511.3 21
- QA267.5.S4 M29 2003
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Books
|
Kwara State University Library | QA267.5 .M37 2011 (Browse shelf(Opens below)) | Available | 004885-01 | ||
|
Books
|
Kwara State University Library | QA267.5 .M37 2011 (Browse shelf(Opens below)) | Available | 004885-02 | ||
|
Books
|
Kwara State University Library | QA267.5 .M37 2011 (Browse shelf(Opens below)) | Available | 004885-03 | ||
|
Books
|
Kwara State University Library | QA267.5 .M37 2011 (Browse shelf(Opens below)) | Available | 004885-04 |
Browsing Kwara State University Library shelves Close shelf browser (Hides shelf browser)
| QA267.3 .L38 2014 Languages and automata theory and applications : 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings / | QA267.5 .M37 2011 Introduction to languages and the theory of computation / | QA267.5 .M37 2011 Introduction to languages and the theory of computation / | QA267.5 .M37 2011 Introduction to languages and the theory of computation / | QA267.5 .M37 2011 Introduction to languages and the theory of computation / | QA273.A53 2018 Probability: A lively introduction | QA273.A53 2018 Probability: A lively introduction |
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.