Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Covers the Lempel-Ziv universal coding algorithm and invertible finite state machines in information theory.
Explores training robots through reinforcement learning and learning from demonstration, highlighting challenges in human-robot interaction and data collection.
Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Explores the control challenge in soft robotic systems and the use of simplified models with nonlinear control theory for dynamic task execution.
