Skip to main content
SpringerLink
Log in

Regular Expression Matching

2004; Navarro, Raffinot

  • Reference work entry
Encyclopedia of Algorithms

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 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Aho, A.: Algorithms for Finding Patterns in Strings. In: van Leewen, J. (ed.) Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, pp. 255–300. Elsevier Science, Amsterdam and MIT Press, Cambridge (1990)

    Google Scholar 

  2. Geffert, V.: Translation of binary regular expressions into nondeterministic ε-free automata with \( { \mathcal{O}(n \log n) } \) transitions. J. Comput. Syst. Sci. 66(3), 451–472 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16, 1–53 (1961)

    Article  Google Scholar 

  4. Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  5. Hopcroft, J., Ullman, J.: Introduction to Automata, Languages, and Computation. Addison-Wesley, Reading, MA (1979)

    Google Scholar 

  6. Ilie, L., Navarro, G., Yu, S.: On NFA reductions. In: Karhumäki, J. et al. (eds.) Theory is Forever. Lect. Notes Comput. Sci. 3113, 112–124 (2004)

    Google Scholar 

  7. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117–1141 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kleene, S.C.: Representation of events in nerve sets. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–40. Princeton Univ. Press, Princeton (1956)

    Google Scholar 

  9. McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Elect. Comput. 9(1), 39–47 (1960)

    Article  Google Scholar 

  10. Myers, E.: A four Russians algorithm for regular expression pattern matching. J. ACM 39(2), 430–448 (1992)

    Article  MATH  Google Scholar 

  11. Navarro, G.: Nr-grep: a fast and flexible pattern matching tool. Softw. Pr. Exp. 31, 1265–1312 (2001)

    Article  MATH  Google Scholar 

  12. Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings – Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  13. Navarro, G., Raffinot, M.: New techniques for regular expression searching. Algorithmica 41(2), 89–116 (2004)

    Article  MathSciNet  Google Scholar 

  14. Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 419–422 (1968)

    Article  MATH  Google Scholar 

  15. Watson, B.: Taxonomies and Toolkits of Regular Language Algorithms, Ph. D. Dissertation, Eindhoven University of Technology, The Netherlands (1995)

    Google Scholar 

  16. Wu, S., Manber, U.: Agrep – a fast approximate patter-matching tool. In: Proceedings of the USENIX Technical Conf., pp. 153–162 (1992)

    Google Scholar 

  17. Wu, S., Manber, U.: Fast text searching allowing errors. Commun. ACM 35(10), 83–91 (1992)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, London, ON, Canada

    Lucian Ilie

Authors
  1. Lucian Ilie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Ilie, L. (2008). Regular Expression Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_340

Download citation

Publish with us

Policies and ethics

Search

Navigation