#algorithms

A retrospective look at my 2021 University of Melbourne vacation research project on minimum Euclidean skeletons, a geometric graph theory optimisation problem.

We construct a Deterministic Finite Automaton that recognises the set of arbitrary-length valid card numbers as per the Luhn check digit algorithm and abuse reality to derive an (executable!) regex with millions of characters.