Computer Science - Graduate CS - Theory of computation - Computability and Complexity

4 sections. Section 1 'Automata Theory': Finite Automata (DFA/NFA): recognize regular languages (email validation, simple patterns). Pushdown Automata: recognize context-free languages (matching parentheses, programming syntax). Turing Machine: recognizes recursively enumerable languages (anything c