COMP 2613

(3 credits) 3 hours lecture, 2 hours tutorial (formerly COMP 3313) This course provides students with an opportunity to gain insight into the theoretical foundations of computing science. Topics include abstract machines (finite automata; push down automata and Turing machines), the hierarchy of formal languages (regular, context-free, and recursive) recognized by these machines, and applications of these languages.