History behind Regex-TDFA?

I am currently looking at the regex-tdfa package.

It says the following:

This package provides a pure Haskell “Tagged” DFA regex engine for regex-base. This implementation was inspired by the algorithm (and Master’s thesis) behind the regular expression library known as TRE or libtre.

I have the following questions:

  1. What is the /Tagged/ DFA technique?
  2. Can someone provide me a link to the Master’s Thesis?
1 Like

Hello!

The tagged DFA technique is quite well known - the wikipedia article on the topic is actually quite readable and explains the topics well. The corresponding paper introducing them is reference 2 on that page, due to Laurikari (2000).

5 Likes

Thanks! I did not know about this.