Mathematical introduction to computing: finite automata, regular languages, context-free languages, computability, decidability, and NP-completeness.
176
Mathematical introduction to computing: finite automata, regular languages, context-free languages, computability, decidability, and NP-completeness.