Skip to main content
SpringerLink
Log in

Algorithms and automata

  • Applications Of The Theory Of Automata
  • Conference paper
  • First Online:
Formal Properties of Finite Automata and Applications (LITP 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 386))

Included in the following conference series:

  • 176 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. A.V. Aho & M.J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM18 (1975) 333–340.

    Article  Google Scholar 

  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. 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.

    Article  Google Scholar 

  4. R.S. Boyer & J.S. Moore, A fast string searching algorithm, Comm. ACM20 (1977) 762–772.

    Article  Google Scholar 

  5. C. Choffrut & M.P. Schützenberger, Counting with rationnal functions, to appear in Theoret. Comput. Sci. (1988).

    Google Scholar 

  6. M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci.45 (1986) 63–86.

    Google Scholar 

  7. Z. Galil, String Matching in real time, J. Assoc. Comput. Mach.28, 1 (1981) 134–149.

    Google Scholar 

  8. D.S. Hirshberg & L.L. Larmore, New applications of failure functions, J. Assoc. Comput. Mach.34, 3 (1987) 616–625.

    Google Scholar 

  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. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1982.

    Google Scholar 

  11. A.O. Slisenko, Detection of periodicities and string-matching in real-time, J. of Soviet Mathematics22, 3 (1983) 1316–1387.

    Article  Google Scholar 

  12. P. Weiner, Linear pattern matching algorithms, IEEE Symposium on Switching and Automata Theory, Vol. 14, IEEE, New York (1972)) 1–11.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Paris-Nord avenue I-B Clément, F - 93430, VILLETANEUSE

    Maxime Crochemore

Authors
  1. Maxime Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. E. Pin

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crochemore, M. (1989). Algorithms and automata. In: Pin, J.E. (eds) Formal Properties of Finite Automata and Applications. LITP 1988. Lecture Notes in Computer Science, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013119

Download citation

  • DOI: https://doi.org/10.1007/BFb0013119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51631-6

  • Online ISBN: 978-3-540-46721-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation