I'm trying to draw up a taxonomy of algorithms for transforming regular expressions into automata so as to perform some empirical tests of their complexity properties in specific domains.
I'm aware of several of the 'bigger' names, e.g.,
"Regular Expression Search Algorithm", Thompson, 1968
"A New Quadratic Algorithm to Convert a Regular Expression into an Automaton", Ponty, et. al, 1996
"Partial Derivatives of Regular Expressions and Finite Automata Constructions", Antimirov, 1996
"Follow Automata", Ilie, et. al, 2003;
"Computing the follow automaton of an expression", Champarnaud, et. al, 2002
"Translating Regular Expressions into Small e-Free Nondeterministic Finite Automata", Hromkovic, et. al, 2001
and their distinguishing properties (epsilon-free-ness, determinism, size, minimization, etc.) but I know this is not an exhaustive list.
I'm particularly interested in algorithms which present either significantly different time complexities to those listed above, and/or significantly different topologies.
If you know of others, a link to a paper which describes the construction algorithm in detail would be greatly appreciated (read necessary if I'm going to implement it!)
Edit: Added some references as per requested.