Theory of Automata
Build rigor in formal languages, automata, grammars, and computability.
Attempts
0
Completed study sessions in this course.
Study lanes
6
Quiz, exam, and homework sets currently available.
Reference stack
3
Linked resources plus notes and course-specific reference sheets.
What lives here
Public study materials, course notes, and the full practice bank for this course lane.
Notes stack
One course note, one cheat sheet, and 3 linked external references.
Topic signals
Start one quiz to unlock topic-level mastery signals.
Mode switcher
Quiz practice
Work through mastery-focused practice sets with clear review loops and study-mode variants.
Sets, Relations & Proof Techniques
Set operations, binary relations, functions, induction proofs, and closures — from HW1 and Test 1.
Best score
0%
Last score
Not attempted
DFA, NFA & Regular Languages
DFA/NFA construction, regex-to-automata conversion, language acceptance, and pumping lemma — from HW2 and Test 1.
Best score
0%
Last score
Not attempted
Topic mastery
No topic data yet. Start a quiz to unlock mastery bars.
Preview the lane
Quiz lane
Frequent practice, low friction, best for topic repetition and cadence.
Exam lane
Pressure-tested reps with stronger timing focus and fewer recovery cues.
Homework lane
Longer-form work with review patterns that feel closer to an assignment desk.