Elements of the Theory of Computation,
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Contents:
Sets, Relations, and Languages. 2. Finite Automata. 3. Context-free Languages. 4. Turing Machines. 5. Undecidability. 6. Computational Complexity. 7. NP-completeness
Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
![]() |
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.