Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. A. V. Aho, J. E. Hoperoft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.
2. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussier, and R. McConnell, Building the minimal DFA for the set of all subwords of a word on-line in linear time, Eleventh International Colloquium on Automata, Languages and Programming (Antwerp, Belgium, 1984), to be presented, July 18, 1984.
3. J. E. Hoperoft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Massachusetts, 1979.
4. M. E. Majster and A. Reiser, Efficient on-line construction and correction of position trees, SIAM Journal on Computing 9, 4 (November 1980), 785–807.
5. E. M. McCreight, A space-economical suffix tree construction algorithm, Journal of the Association for Computing Machinery 23, 2 (April 1976), 262–272.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献