Reference20 articles.
1. Aho A (1990) Algorithms for finding patterns in strings. In: van Leeuwen J (ed) Handbook of theoretical computer science. Algorithms and Complexity, vol A. MIT Press Cambridge, MA, pp 255–300
2. Bille P, Thorup M (2009) Faster regular expression matching. In: Albers S et al (eds) Automata, languages and programming. Springer, Berlin/Heidelberg, pp 171–182
3. Bille P, Thorup M (2010) Regular expression matching with multi-strings and intervals. In: Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms, SIAM, Philadelphia, PA, pp 1297–1308
4. Geffert V (2003) Translation of binary regular expressions into nondeterministic
$$\epsilon $$
-free automata with
$$\mathcal{O}(n\log n)$$
transitions. J Comput Syst Sci 66(3):451–472
5. Glushkov V-M (1961) The abstract theory of automata. Russ Math Surv 16:1–53
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献