Theory of Computation

ID : 
Κ25
Semester : 
7
Credit hours (lecture): 
3
Credit hours (discussion): 
1
Credit hours (lab): 
0
Track: 
Core Informatics and Telecommunications

Countable sets, diagonalization, regular languages, finite automata, context-free languages, pushdown automata, Turing machines, recursive and recursively enumerable languages, undecidability, introduction to complexity theory, NP-completeness.