views:

55

answers:

1

I came across a regular expression library http://laurikari.net/tre/ and also http://hackage.haskell.org/package/regex-tdfa , but I could not find anything about this "tagged DFA" approach that they are using: neither on the pages of these libraries, nor in google (incl.scholar).

Anyone know what it is about?

+1  A: 

Here is a paper:

NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions (2000) [PDF], written by Ville Laurikari.

Nick D
Thanks! Incidentally, I've just found the same paper and also the actual thesis: <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.2799">Efficient Submatch Addressing for Regular Expressions</a>
jkff
@jkff: IIRC, Ville Laurikari had in his previous site a link to his thesis pdf, but now he doesn't.
Nick D