Lewis, Harry R
Elements of the Theory of Computation,
- Noida Pearson Education Asia, 2015.
- ix, 361p.
Sets, Relations, and Languages. 2. Finite Automata. 3. Context-free Languages. 4. Turing Machines. 5. Undecidability. 6. Computational Complexity. 7. NP-completeness
9789332549890
Computational complexity.
Logic, Symbolic and mathematical.
Formal languages.
511.3 / LEW/E