Menu
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?
765
Here is a paper:
NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions (2000) [PDF], written by Ville Laurikari.
58
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
