Finite Automata, Nondeterministric Automata, Stack Automata, Formal Languages, Gramers. Turing Machines, Equivalence Of Computational Models, Church's Thesis, Universal Machine, Undecidable Problems, Reduction, The Classes P, Np, Np-completeness.

Faculty: Education in Science and Technology
|Undergraduate Studies
Course with no extra credit

236343 - Theory of Computation 236353 - Automata and Formal Languages 237343 - Theory of Computation