Algorithms and automata

  • Maxime Crochemore
Applications Of The Theory Of Automata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 386)


Transition Function Terminal State String Match Failure Function Deterministic Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [1]
    A.V. Aho & M.J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM18 (1975) 333–340.CrossRefGoogle Scholar
  2. [2]
    A.V. Aho, J.E. Hopcroft & J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, Mass., 1974.Google Scholar
  3. [3]
    A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen & J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci.40, 1 (1985) 31–56.CrossRefGoogle Scholar
  4. [4]
    R.S. Boyer & J.S. Moore, A fast string searching algorithm, Comm. ACM20 (1977) 762–772.CrossRefGoogle Scholar
  5. [5]
    C. Choffrut & M.P. Schützenberger, Counting with rationnal functions, to appear in Theoret. Comput. Sci. (1988).Google Scholar
  6. [6]
    M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci.45 (1986) 63–86.Google Scholar
  7. [7]
    Z. Galil, String Matching in real time, J. Assoc. Comput. Mach.28, 1 (1981) 134–149.Google Scholar
  8. [8]
    D.S. Hirshberg & L.L. Larmore, New applications of failure functions, J. Assoc. Comput. Mach.34, 3 (1987) 616–625.Google Scholar
  9. [9]
    D.E. Knuth, J.H. Morris & V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput.6, 2 (1977) 323–350.Google Scholar
  10. [10]
    Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1982.Google Scholar
  11. [11]
    A.O. Slisenko, Detection of periodicities and string-matching in real-time, J. of Soviet Mathematics22, 3 (1983) 1316–1387.CrossRefGoogle Scholar
  12. [12]
    P. Weiner, Linear pattern matching algorithms, IEEE Symposium on Switching and Automata Theory, Vol. 14, IEEE, New York (1972)) 1–11.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Maxime Crochemore
    • 1
  1. 1.Université de Paris-Nord avenue I-B ClémentVILLETANEUSE

Personalised recommendations