A Little Bit of Theory

This post originally appeared on the Software Carpentry website.

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.

Dialogue & Discussion

Comments must follow our Code of Conduct.

Edit this page on Github