Programming

Converting NFAs to regular expressions by solving linear systems of equations

Let’s write a compiler for a probabilistic programming language using probability generating functions in 200 lines of Python

An exposition of the bitap or shift-and exact string matching algorithm

Counting down, seemingly without loops or recursion

Tests that expose gaps in your thinking instead of confirming what you already know