CSI 3104 Introduction to Formal Languages
3 units
Computer Science
Faculty of Engineering
Regular languages, finite automata, transition graphs Kleene's theorem. Finite automata with output. Context-free languages, derivation trees, normal form grammars, pumping lemma, pushdown automata, determinism. Decidability. Recursively enumerable languages, Turing machines, the halting problem.
Components:
Lecture
Previously Offered Terms:
Winter
Summer
French Equivalent:
Organized
392 responses
4.41
/ 5
Clear Expectations
273 responses
4.32
/ 5
Learned a Lot
393 responses
4.28
/ 5
Recommend
119 responses
4.27
/ 5
Workload
118 responses
2.76
/ 5
Fair Assessments
392 responses