Elements of the Theory of Computation,
Material type:
TextPublication details: Noida Pearson Education Asia, 2015.Description: ix, 361pISBN: - 9789332549890
- 511.3 LEW/E
Contents:
Sets, Relations, and Languages. 2. Finite Automata. 3. Context-free Languages. 4. Turing Machines. 5. Undecidability. 6. Computational Complexity. 7. NP-completeness
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
|
Central Library, Sikkim University General Book Section | 511.3 LEW/E (Browse shelf(Opens below)) | Available | 050999 |
Total holds: 0
Sets, Relations, and Languages. 2. Finite Automata. 3. Context-free Languages. 4. Turing Machines. 5. Undecidability. 6. Computational Complexity. 7. NP-completeness
There are no comments on this title.
Log in to your account to post a comment.
