Skip to main content
SpringerLink
Log in

Finite Automata for Generalized Approach to Backward Pattern Matching

  • Conference paper
Implementation and Application of Automata (CIAA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6482))

Included in the following conference series:

  • 588 Accesses

Abstract

We generalized the DAWG backward pattern matching approach to be able to solve a broad range of pattern matching problems. We use a definition of a class of problems. We describe a finite automaton for the basic pattern matching problem of finding an exact occurrence of one string in a text. We propose a mechanism to use simple operations over finite automata in a systematic approach to derive automata for solving problems from a defined class, such as approximate matching, regular expression matching, sequence matching, matching of set of patterns, etc. and their combinations. The benefit of this approach is the ability to quickly derive solutions for newly formulated pattern matching problems.

This research has been partially supported by the research program MSMT 6840770014 and by The Czech Science Foundation as project No. 201/09/0807.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Aho, A.V., Corasick, M.J.: Efficient String Matching: An Aid to Bibliographic Research. Communications of ACM 18(6), 333–340 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  2. Allauzen, C., Crochemore, M., Raffinot, M.: Factor Oracle: A New Structure for Pattern Matching. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 295–306. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Antoš, J.: Automaton-based Backward Pattern Matching. Dissertation thesis. CTU in Prague (2010), http://www.stringology.org/papers/Antos-PhD_thesis-2010.pdf

  4. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. C. ACM 20(10), 762–772 (1977)

    Article  MATH  Google Scholar 

  5. Chvatal, V., Klarner, D.A., Knuth, D.E.: Selected Combinatorial Research Problems. STAN-CS-72-292, Stanford University (1972)

    Google Scholar 

  6. Cleophas, L., Watson, B.W., Zwaan, G.: Automaton-based sublinear keyword pattern matching. In: Proceedings of the 11th SPIRE, Padova, Italy (2004)

    Google Scholar 

  7. Crochemore, M., Czumaj, A.: Ga̧sieniec, L., et al.: Deux méthodes pour accélerer l’algorithme de Boyer-Moore. In: Actes des 2e Journées franco-belges: Théories des Automates et Applications, pp. 45–63. Public. de l’Univ. de Rouen, No. 176 (1991)

    Google Scholar 

  8. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  9. Hamming, R.W.: Error-detecting and error-correcting codes. Bell System Technical Journal 29(2), 147–160 (1950)

    Article  MathSciNet  Google Scholar 

  10. Hopcroft, J.E., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (2001)

    MATH  Google Scholar 

  11. Kleene, S.C.: Representation of Events in Nerve Nets and Finite Automata. In: Automata Studies, pp. 3–42. Princeton University Press, Princeton (1956)

    Google Scholar 

  12. Lecroq, T.: A variation on the Boyer-Moore algorithm. Theoretical Computer Science 92(1), 119–144 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR 163(4), 845–848 (1965)

    MathSciNet  MATH  Google Scholar 

  14. Melichar, B.: String Matching with k Differences by Finite Automata. In: Proceedings of the 13th ICPR, vol. II, pp. 256–260 (1996)

    Google Scholar 

  15. Melichar, B., Holub, J.: 6D Classification of Pattern Matching Problems. In: Proceedings of PSC 1997, Prague, Czech republic, pp. 24–32 (1997)

    Google Scholar 

  16. Melichar, B., Holub, J., Polcar, T.: Text Searching Algorithms, vol. I, II (2005), http://psc.felk.cvut.cz/athens/

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Faculty of Electrical Engineering, Czech Technical University, Karlovo nám. 13, 121 35, Prague 2, Czech Republic

    Jan Antoš

  2. Department of Theoretical Science, Faculty of Information Technology, Czech Technical University, Kolejní 2, 160 00, Prague 6, Czech Republic

    Bořivoj Melichar

Authors
  1. Jan Antoš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bořivoj Melichar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antoš, J., Melichar, B. (2011). Finite Automata for Generalized Approach to Backward Pattern Matching. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18098-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18097-2

  • Online ISBN: 978-3-642-18098-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation