论文信息 - String Matching in Real Time - 字舞流文

String Matching in Real Time

A sufficient condition for an on-line algorithm to be transformed into a real-time algorithm is given. This condition is used to construct real-time algorithms for various string-matching problems by random access machines and by Turing machines.

Zvi Galil | Z. Galil

[1] Zvi Galil. Real-time algorithms for string-matching and palindrome recognition , 1976, STOC '76.

[2] M. Fischer,et al. STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[3] Zvi Galil. Palindrome Recognition in Real Time by a Multitape Turing Machine , 1978, J. Comput. Syst. Sci..

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

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

[6] Glenn K. Manacher,et al. A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String , 1975, JACM.

[7] Yu. V. Matiyasevich. Real-time recognition of the inclusion relation , 1972 .

[8] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[9] Robert E. Tarjan,et al. Storing a sparse table , 1979, CACM.

[10] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[11] M. Rabin. Real time computation , 1963 .

[12] Arnold L. Rosenberg,et al. Real-Time Simulation of Multihead Tape Units , 1972, JACM.

[13] Journal of the Association for Computing Machinery , 1961, Nature.