Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Introduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.
Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Covers context-free grammars, including the definition of non-terminal and terminal symbols, rules for generating strings, and the concept of derivations.
