Skip to main content
SpringerLink
Log in

Automata for Matching Patterns

  • Chapter
  • First Online:
Handbook of Formal Languages

Abstract

This chapter describes several methods of word pattern matching that are based on the use of automata.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 5, pages 255–300. Elsevier, Amsterdam, 1990.

    Google Scholar 

  2. A. V. Aho and M. J. Corasick. Efficient string matching: an aid to biblio- graphic search. Communications of the ACM, 18: 333–340, 1975.

    Article  MathSciNet  Google Scholar 

  3. A. V. Aho, J. E. Hoperoft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, 1974.

    MATH  Google Scholar 

  4. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers - Principles, techniques and tools. Addison-Wesley, Reading, MA, 1986.

    MATH  Google Scholar 

  5. A. Amir and M. Farach. Adaptative dictionary matching. In Proceedings of the 32th IEEE Annual Symposium on Foundations of Computer Science, pages 760–766. IEEE Computer Society Press, 1991.

    Google Scholar 

  6. A. Amir, M. Farach, Z. Galil, R. Giancarlo, and K. Park. Fully dynamic dictionary matching. Journal of Computer and System Sciences, 49: 208–222, 1994.

    Article  MathSciNet  Google Scholar 

  7. S. Baase. Computer algorithms - Introduction to design and analysis. Addison-Wesley, Reading, MA, 1988.

    MATH  Google Scholar 

  8. R. A. Baeza-Yates, C. Choffrut, and G. H. Gonnet. On Boyer-Moore automata. Algorithmica, 12: 268–292, 1994.

    Article  MathSciNet  Google Scholar 

  9. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussier, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40: 31–55, 1985.

    Article  MathSciNet  Google Scholar 

  10. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20: 762–772, 1977.

    Article  Google Scholar 

  11. D. Breslauer. Dictionary-matching on unbounded alphabets: uniform length dictionaries. Journal of Algorithms, 18: 278–295, 1995.

    Article  MathSciNet  Google Scholar 

  12. D. Breslauer, L. Colussi, and L. Toniolo. Tight comparison bounds for the string prefix-matching problem. Information Processing Letters, 47: 51–57, 1993.

    Article  MathSciNet  Google Scholar 

  13. V. Bruyère. Automates de Boyer-Moore. Thèse annexe, Université de Mons-Hainaut, Belgique, 1991.

    Google Scholar 

  14. B. Commentz-Walter. A string matching algorithm fast on the average. In Proceedings of the 6th International Conference on Automata, Languages and Programmation, Lecture Notes in Computer Science, pages 118–132. Springer-Verlag, Berlin, 1979.

    Google Scholar 

  15. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press, 1990.

    Google Scholar 

  16. M. Crochemore. Transducers and repetitions. Theoretical Computer Science, 45: 63–86, 1986.

    Article  MathSciNet  Google Scholar 

  17. M. Crochemore. String-matching on ordered alphabets. Theoretical Computer Science, 92: 33–47, 1992.

    Article  MathSciNet  Google Scholar 

  18. M. Crochemore and D. Perrin. Two-way string-matching. Journal of the ACM, 38: 651–675, 1991.

    Article  MathSciNet  Google Scholar 

  19. M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.

    Google Scholar 

  20. Z. Galil. String matching in real time. Journal of the ACM, 28: 134–149, 1981.

    Article  MathSciNet  Google Scholar 

  21. Z. Galil and J. Seiferas. Time-space optimal string matching. Journal of Computer and System Sciences, 26: 280–294, 1983.

    Article  MathSciNet  Google Scholar 

  22. L. Ggsieniec, W. Plandowski, and W. Rytter. The zooming method: a recursive approach to time-space efficient string-matching. Theoretical Computer Science, 147: 19–30, 1995.

    Article  MathSciNet  Google Scholar 

  23. G. H. Gonnet and R. A. Baeza-Yates. Handbook of algorithms and data structures. Addison-Wesley, Reading, MA, 1991.

    MATH  Google Scholar 

  24. C. Hancart. On Simon’s string searching algorithm. Information Processing Letters, 47: 95–99, 1993.

    Article  MathSciNet  Google Scholar 

  25. R. M. Idury and A.A. Schäffer. Dynamic dictionary matching with failure function. Theoretical Computer Science, 131: 295–310, 1994.

    Article  MathSciNet  Google Scholar 

  26. D. E. Knuth, J. H. Morris, Jr, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6: 323–350, 1977.

    Article  MathSciNet  Google Scholar 

  27. G. Kucherov and M. Rusinowitch. Matching a set of strings with variable length don’t cares. In Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 937, pages 230–247. Springer-Verlag, Berlin, 1995.

    Google Scholar 

  28. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of Algorithms, 23: 262–272, 1976.

    MathSciNet  MATH  Google Scholar 

  29. D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 1, pages 1–57. Elsevier, Amsterdam, 1990.

    Google Scholar 

  30. I. Simon. String matching algorithms and automata. In Results and Trends in Theoretical Computer Science, Lecture Notes in Computer Science, vol. 814, pages 386–395. Springer-Verlag, Berlin, 1994.

    Chapter  Google Scholar 

  31. G. A. Stephen. String searching algorithms. World Scientific Press, Singapore, 1994.

    Book  Google Scholar 

  32. K. Thompson. Regular expression search algorithm. Communications of the ACM, 11: 419–422, 1968.

    Article  Google Scholar 

  33. E. Ukkonen. Constructing suffix trees on-line in linear time. In J. van Leeuwen, editor, Proceedings of the IFIP 12th World Computer Congress,Madrid, 1992, pages 484–492, North-Holland.

    Google Scholar 

  34. M.S. Waterman. Introduction to computational biology. Chapman and Hall, London, 1995.

    Book  Google Scholar 

  35. P. Weiner. Linear pattern matching algorithm. In Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, pages 1–11, 1973.

    Google Scholar 

Download references

Authors
  1. Maxime Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe Hancart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Leiden University, P.O. Box 9512, NL-2300 RA, Leiden, The Netherlands

    Grzegorz Rozenberg

  2. Department of Computer Science, University of Colorado at Boulder, Campus 430, 80309, Boulder, CO, USA

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science Data City, FIN-20520, Turku, Finland

    Arto Salomaa

  4. Academy of Finland and Turku Centre for Computer Science (TUCS), Lemninkäisenkatu 14 A, FIN-20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Crochemore, M., Hancart, C. (1997). Automata for Matching Patterns. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07675-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-07675-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08230-6

  • Online ISBN: 978-3-662-07675-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation