Elements of the Theory of Computation,
Material type: TextPublication details: Noida Pearson Education Asia, 2015Description: ix, 361pISBN: 9789332549890Subject(s): Computational complexity | Logic, Symbolic and mathematical | Formal languagesDDC classification: 511.3
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 |
---|---|---|---|---|---|---|
General Books | Central Library, Sikkim University General Book Section | 511.3 LEW/E (Browse shelf(Opens below)) | Available | 050999 |
Total holds: 0
Browsing Central Library, Sikkim University shelves, Shelving location: General Book Section Close shelf browser (Hides shelf browser)
511.3 EXN/A An accompaniment to higher mathematics // | 511.3 GIN/A Algebraic logic / | 511.3 KOZ/A Automata and Computability, Undergraduate Texts in Computer Science. | 511.3 LEW/E Elements of the Theory of Computation, | 511.3 MAN/C A course in mathematical logic for mathematicians/ | 511.3 MON/M Mathematical logic/ | 511.3 MOS/L Logic from Computer Science/ |
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.