Embed Notice

Incidentally Brzozowski's Algorithm is:

1. Inverse the DFA graph, at which point it may now be non-determinstic.
2. Convert the that inverse graph into a DFA.
3. Uninvert it!

I've got a hypothetical for evaluating NFAs (with function calls) I love toying with! Though realistically there'd be limits on the NFAs it can evaluate, so I'd have a handful of optimization passes (including Brzozowski's) to bring the NFA within those limits!

5/4!