Reference29 articles.
1. A.V. Aho & M.J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM18 (1975) 333–340.
2. A.V. Aho, J.E. Hopcroft & J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, Mass., 1974.
3. A. Apostolico & F.P. Preparata, Optimal off-line detection of repetitionsin a string, Theoret. Comput. Sci.22 (1983) 297–315.
4. D.R. Bean, A. Ehrenfeucht & G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math.85 (1979) 261–294.
5. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen & J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci.40, 1 (1985) 31–56.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献