Explores formal language operations, including concatenation, union, intersection, and Kleene star for language repetition.
Explores the theoretical properties and practical power of Recurrent Neural Networks, including their relationship to state machines and Turing completeness.
Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Covers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.
