Module 2 of the Theory of Computation focuses on regular expressions, covering their definitions, rules, and examples. Key topics include concatenation, union, and repetition of regular expressions, along with converting finite state machines (FSM) to regular expressions. The module also discusses proving languages are not regular and closure properties.