The third episode of our lecture on regular expressions is now on the web. This one describes how regular expressions are implemented using finite state machines: it’s more theoretical (with a very small ‘t’) than previous episodes, and we’d welcome feedback.