Languages and machines : an introduction to the theory of computer science / Thomas A. Sudkamp
By: Sudkamp, Thomas A
.
Publisher: Reading, Mass. : Addison-Wesley Pub, c1997Edition: 2nd ed.Description: xv, 569 p. : ill. ; 24 cm.ISBN: 0201821362.Subject(s): Computational complexity | Formal languages | Machine theoryDDC classification: 511.3 | Item type | Current location | Shelf location | Call number | Copy number | Status | Notes | Date due | Barcode |
|---|---|---|---|---|---|---|---|---|
| Main Collection | Taylor's Library-TU |
Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 4 |
511.3 SUD (Browse shelf) | 1 | Available | SOCIT,15003,02,GR | 5000030380 | |
| Main Collection | Taylor's Library-TU |
Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 4 |
511.3 SUD (Browse shelf) | 1 | Available | SOCIT,15004,02,GR | 5000030391 | |
| Main Collection | Taylor's Library-TU |
Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 4 |
511.3 SUD (Browse shelf) | 1 | Available | SOCIT,15008,02,GR | 5000030382 | |
| Main Collection | Taylor's Library-TU |
Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 4 |
511.3 SUD (Browse shelf) | 1 | Available | SOCIT,15009,02,GR | 5000030516 | |
| Main Collection | Taylor's Library-TU |
Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 4 |
511.3 SUD (Browse shelf) | 1 | Available | SOCIT,15010,02,GR | 5000030351 | |
| Main Collection | Taylor's Library-TU |
Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 4 |
511.3 SUD (Browse shelf) | 1 | Available | SOCIT,15011,02,GR | 5000030475 |
Browsing Taylor's Library-TU Shelves Close shelf browser
| 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : | 511.3 SUN Mathematical reasoning : | 511.3 TRO Basic proof theory / |
Part I Foundations: 1. Mathematical preliminaries. 2. Languages. - Part II Context-free grammars and parsing: 3. Context-free grammars. 4. Parsing: an introduction. 5. Normal forms. - Part III Automata and languages: 6. Finite automata. 7. Regular languages and sets. 8. Pushdown automata and context-free languages. 9. Turing machines. 10. The Chomsky hierarchy. - Part IV Decidability and computability : 11. Decidability. 12. Numeric computation. 13. Mu-recursive functions. - Part V Computational complexity: 14. Computational complexity. 15. Tractability and NP-complete problems. - Part VI Deterministic parsing: 16. LL(k) Grammars. 17. LR(k) Grammars.