Theory of Computation : Homework Problems & Solution

Lec 02: Finite State Machine (Prerequisites)
Lec 03: Finite State Machine (Finite Automata)
Lec 04: Deterministic Finite Automata (Example-1)
Lec 05: Deterministic Finite Automata (Example-2)
Lec 06: Deterministic Finite Automata (Example-3)
Lec 07: Deterministic Finite Automata (Example-4)
Lec 08: Regular Languages
Lec 09: Operations on Regular Languages
Lec 10: Non-deterministic Finite Automata
Lec 11: Formal Definition of NFA
Lec 12: NFA Examples (Part 1)
Lec 13: NFA Examples (Part 2)
Lec 14: NFA Examples (Part 3)
Lec 15: Conversion of NFA to DFA
Lec 16: Conversion of NFA to DFA - Examples (Part 1)