Asymptotic Estimation of the Average Number of Terminal States in DAWGs
暂无分享,去创建一个
[1] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .
[2] David Haussler,et al. Average sizes of suffix trees and DAWGs , 1989, Discret. Appl. Math..
[3] Philippe Flajolet,et al. Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals , 1995, Theor. Comput. Sci..
[4] Philippe Flajolet,et al. The Average case analysis of algorithms : counting and generating functions , 1993 .
[5] Dominique Perrin,et al. Finite Automata , 1958, Philosophy.
[6] Philippe Flajolet,et al. An introduction to the analysis of algorithms , 1995 .
[7] Wojciech Plandowski,et al. Speeding Up Two String-Matching Algorithms , 1992, STACS.
[8] Maxime Crochemore,et al. Automata for Matching Patterns , 1997, Handbook of Formal Languages.
[9] Philippe Flajolet,et al. Mellin Transforms and Asymptotics: Harmonic Sums , 1995, Theor. Comput. Sci..
[10] Philippe Jacquet,et al. Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach , 1994, J. Comb. Theory A.
[11] P. Flajolet,et al. Some Uses of the Mellin Integral Transform in the Analysis of Algorithms , 1985 .
[12] Wojciech Rytter,et al. Text Algorithms , 1994 .
[13] Philippe Flajolet,et al. The Average case analysis of algorithms : complex asymptotics and generating functions , 1993 .