论文信息 - String matching with simple devices

String matching with simple devices

With the help of a general simulation technique of deterministic finite two-way multi-head automata by automata with blind heads we show O(n^2/logn) to be an upper time bound on string matching. This result is tight by a previously known lower bound.

Holger Petersen

[1] Zvi Galil,et al. Time-Space-Optimal String Matching , 1983, J. Comput. Syst. Sci..

[2] Wojciech Plandowski,et al. The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching , 1995, Theor. Comput. Sci..

[3] Zvi Galil,et al. Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines , 1982, Theor. Comput. Sci..

[4] Tao Jiang,et al. k one-way heads cannot do string-matching , 1993, J. Comput. Syst. Sci..

[5] Maxime Crochemore,et al. Two-way string-matching , 1991, JACM.

[6] Wojciech Rytter,et al. On maximal suffixes, constant-space linear-time versions of KMP algorithm , 2003, Theor. Comput. Sci..

[7] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[8] Ming Li,et al. Three One-Way Heads Cannot Do String Matching , 1994, J. Comput. Syst. Sci..

[9] Tao Jiang,et al. K One-Way Heads Cannot Do String-Matching , 1996, J. Comput. Syst. Sci..

[10] Ming Li. Lower Bounds on String-Matching , 1984 .

[11] Ming Li,et al. String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation , 1986, Inf. Process. Lett..

[12] Maxime Crochemore. String-Matching on Ordered Alphabets , 1992, Theor. Comput. Sci..