论文信息 - Optimal Factor Transducers

Optimal Factor Transducers

Amons strins-matchins alsorithms the two most efficient methoos of Knuth-Morris-Pratt [KMP 77] and Weiner [We 73] are usually considered as opposite of each others, In this paper we show that automata theory unifies the two approaches and sives a simple and efficient alsorithm to construct the structure, a sequential transducer, underlyins Weiner’s method.

Maxime Crochemore

[1] Michael Rodeh. A fast test for unique decipherability based on suffix trees , 1982, IEEE Trans. Inf. Theory.

[2] M. Crochemore. Recherche linéaire d'un carré dans un mot , 1983 .

[3] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[4] Franco P. Preparata,et al. Optimal Off-Line Detection of Repetitions in a String , 1983, Theor. Comput. Sci..

[5] David Haussler,et al. Linear size finite automata for the set of all subwords of a word - an outline of results , 1983, Bull. EATCS.

[6] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[7] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.