| 000 | 00828nam a2200241Ia 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20220404124414.0 | ||
| 008 | 220128s9999 xx 000 0 und d | ||
| 020 | _a9789332549890 | ||
| 040 | _cCUS | ||
| 082 |
_a511.3 _bLEW/E |
||
| 100 |
_aLewis, Harry R _95945 |
||
| 245 | 0 | _aElements of the Theory of Computation, | |
| 260 |
_aNoida _bPearson Education Asia, _c2015. |
||
| 300 | _aix, 361p. | ||
| 505 | _aSets, Relations, and Languages. 2. Finite Automata. 3. Context-free Languages. 4. Turing Machines. 5. Undecidability. 6. Computational Complexity. 7. NP-completeness | ||
| 650 |
_a Computational complexity. _94757 |
||
| 650 |
_aLogic, Symbolic and mathematical. _95948 |
||
| 650 |
_aFormal languages. _94756 |
||
| 700 |
_95947 _aPapadimitriou, Christos H |
||
| 942 |
_2ddc _cWB16 |
||
| 947 | _a539 | ||
| 999 |
_c211215 _d211215 |
||