Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. A. Andersson and S. Nilsson. Improved behavior of tries by adaptive branching, Inf. Process. Lett., 46, 6 (1993), 295-300.
2. A. Apostolico and R. Giancarlo. The Boyer-Moore-Galil string searching strategies revisited, SIAM J. Comput., 15, 1 (1986), 98-105.
3. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler and R. McConnel. Linear size finite automata for the set of all subwords of a word: an outline of results, Bull. Eur. Assoc. Theor. Comput. Sci., 21 (1983), 12-20.
4. R. S. Boyer and J. S. Moore. A fast string searching algorithm, Commun. ACM, 20,10 (1977),762-772.
5. D. Breslauer, L. Colussi and L. Toniolo. Tight comparison bounds for the string prefix-matching problem, Inf. Process. Lett., 47, 1 (1993), 51-57.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximate Regular Expressions and Their Derivatives;Language and Automata Theory and Applications;2012