Abstract
In this paper we study the structure of finite automata recognizing sets of the form A*p, for some word p, and use the results obtained to improve the Knuth-Morris-Pratt string searching algorithm. We also determine the average number of nontrivial edges of the above automata.
This work was done with partial support from FAPESP, CNPq and the Fibonacci Institute.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
M. V. A. Andrade. Métodos eficientes para reconhecimento de padrões em texto (in portuguese). Master's thesis, UNICAMP, Campinas, Brazil, 1993.
D. Beauquier, J. Berstel, and P. Chrétienne. Éléments d'algorithmique. Manuels Informatiques Masson. Masson, Paris, 1992.
A. C. Blumer, J. A. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Comput. Sci., 40: 31–55, 1985.
J. A. Brzozowski. Canonical regular expressions and minimal state grahps for definite events. In Proc. of the Symp. of Math. Theory of Automata, pages 529–561, New York, 1962. Polytechnic Institute of Brooklyn.
B. W. Char, K. O. Geddes, G. H. Gonnet, B. L. Leong, M. B. Monagan, and S. M. Watt. Maple V Language Reference Manual. Springer-Verlag, New York, 1991.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The M.I.T. Press, Cambridge, Mass., 1990.
J.-P. Duval. Contribution a la combinatoire du monoïde libre. Thèse, Faculté des Sciences de L'Université de Rouen, 1980.
S. Eilenberg. Automata, Languages, and Machines, Volume A. Academic Press, New York, 1974.
Z. Galil. String matching in real time. J. ACM, 28: 134–149, 1981.
L. J. Guibas and A. M. Odlyzko. Periods in strings. J. Comb. Th. A, 30: 19–42, 1981.
C. Hancart. Analyse Exacte et en Moyenne d'Algorithmes de Recherche d'un Motif dans un Texte. PhD thesis, Université Paris 7, Paris, 1993.
C. Hancart. On Simon's string searching algorithm. Inf. Process. Lett., 47: 95–99, 1993.
D. E. Knuth, J. H. Morris, Jr., and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comput., 6: 323–350, 1977.
J. H. Morris, Jr. and V. R. Pratt. A linear pattern-matching algorithm. Research report 40, University of California, Berkeley, 1970.
M. Perles, M. O. Rabin, and E. Shamir. The theory of definite automata. IEEE Trans. Electronic Computers, EC-12: 233–243, 1963.
M. Regnier. Enumeration of bordered words, le langage de la Vache-Que-Rit. R.A.I.R.O. Informatique Théorique, 26: 303–317, 1992.
R. Sedgewick. Algorithms. Addison-Wesley, Reading, MA, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Simon, I. (1994). String matching algorithms and automata. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_61
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive