Introduction to languages and the theory of computation.
Material type:
Item type | Home library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
![]() |
College Lane Learning Resources Centre Main Shelves | 511.3 MAR (Browse shelf(Opens below)) | Available | 4403894222 |
Enhanced descriptions from Syndetics:
Previous ed.: 1991.
1. Basic Mathematical Objects -- 2. Mathematical Induction and Recursive Definitions -- 3. Regular Expressions and Finite Automata -- 4. Nondeterminism and Kleene's Theorem -- 5. Regular and Nonregular Languages -- 6. Context-Free Grammars -- 7. Pushdown Automata -- 8. Context-Free and Noncontext-Free Languages -- 9. Turing Machines -- 10. Recursively Enumerable and Recursive Languages -- 11. Other Grammars -- 12. Unsolvable Problems -- 13. Computable Functions -- 14. Measuring and Classifying Complexity -- 15. Tractable and Intractable Problems.