Abstract
We present an implementation of a variant of the Knuth-Morris-Pratt pattern matching algorithm that runs in time O(n+m) on a seven-tape Turing machine, where n is the length of the text and m is the length of the pattern.
This research was partially supported by GA ČR Grant No. 201/95/0976
Preview
Unable to display preview. Download preview PDF.
References
Knuth, D. E.-Morris J. H.-Pratt V. B.: Fast pattern matching in string. In: SIAM J. Comput., Vol. 6, June 1977, pp. 323–350
Baeza-Yates, R.: A Unified View to Pattern Matching Problems
Katajainen, J.-van Leeuwen, J.-Penttonen, M.: Fast Simulation of Turing Machines by Random Access Machines. In: SIAM J. Comput., Vol. 17, No.1, February 1988, pp. 77–88
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vovsová, I. (1996). A seven-head dragon for optimal pattern searching. In: Jeffery, K.G., Král, J., Bartošek, M. (eds) SOFSEM'96: Theory and Practice of Informatics. SOFSEM 1996. Lecture Notes in Computer Science, vol 1175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037429
Download citation
DOI: https://doi.org/10.1007/BFb0037429
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61994-9
Online ISBN: 978-3-540-49588-8
eBook Packages: Springer Book Archive