Tim Bray On The Union Of Finite Automata

[Thomas Passin]

For the few readers who are interested in this kind of thing - think unions of regular expressions - and how to write code to process them at very high speed, here is Tim Bray, who wrote some of the Amazon code to do millions of matches per second.

Unions Of Finite Automata

Some background: Quamina - Bray's ultra-fast pattern matcher