3 ms·
See Laurikari's paper on Tagged DFAs. It solves exactly this problem without impacting O(n) matching performance.
by colanderman 13y ago
See Laurikari's paper on Tagged DFAs. It solves exactly this problem without impacting O(n) matching performance.
- JadeNB 13y agoThanks; I hadn't heard of this. To save others hunting down the link, here's a StackOverflow question with a (very little) discussion, a link, and related code: http://stackoverflow.com/questions/3287860/what-is-a-tagged-dfa http://stackoverflow.com/questions/3287860/what-is-a-tagged-...