Languages and machines : an introduction to the theory of computer science / Thomas A. Sudkamp.
By: Sudkamp, Thomas A
.
Publisher: Boston : Pearson Addison-Wesley, c2006Edition: 3rd ed.Description: xvii, 654 p. : ill. ; 24 cm.ISBN: 0321315340 (alk. paper).Subject(s): Formal languages | Machine theory | Computational complexityDDC 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 2, Shelf 1 , Side 2, TierNo 4, BayNo 1 |
511.3 SUD (Browse shelf) | 1 | Available | SOCIT,15005,03,RM | SOCIT,15009,03,RM | SOCIT,15011,03,RM | SOCIT,15008,03,RM | 5000030515 | |
| Main Collection | Taylor's Library-TU |
Floor 4, Shelf 15 , Side 1, TierNo 4, BayNo 4 |
511.3 SUD (Browse shelf) | 1 | Available | SOCIT,15005,03,RM | SOCIT,15009,03,RM | SOCIT,15011,03,RM | SOCIT,15008,03,RM | SOCIT,15010,03,RM | 5000158353 |
Browsing Taylor's Library-TU Shelves Close shelf browser
| 511.3 SHO Mathematical logic / | 511.3 SIP Introduction to the theory of computation / | 511.3 SIP Introduction to the theory of computation / | 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : | 511.3 SUD Languages and machines : |
Includes bibliographical references (p. 641-647) and index.
Mathematical preliminaries - Languages - Context-free grammars - Normal forms for context-free grammars - Finite automata - Properties of regular languages - Pushdown automata and context-free languages - Turing machines - Turing computable functions - The Chomsky hierarchy - Decision problems and the church-turing thesis - Undecidability - Mu-recursive functions - Time complexity - P, NP and Cook's theorem - NP-complete problems - Additional complexity classes - Parsing : an introduction - LL(k) grammars - LR(k) grammars.