A comprehensive Theory of Automata study and past-paper archive built around IBA’s CSE309 offerings, with lectures, exercises, problem sets, quizzes, exams, solutions, and curated external resources from multiple semesters. Open to students from any university and future community contributions.
automata notes computation finite-state-machine preparation time-complexity exams theory-of-computation automata-theory iba decidability finite-automaton p-np theory-of-automata reducability michael-sipser
-
Updated
Jul 29, 2026 - TeX