Formal Languages and Automata Theory covers finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and decidability. MUJ students learn how to analyze computational problems using formal language theory and automata.
betterSLCM gives you a clean interface for your grades, attendance, internal marks, and timetable data from the mujslcm portal — no more struggling with the original MUJ SLCM portal.
Track this course →