Finite Automata for Generalized Approach to Backward Pattern Matching

  • Jan Antoš
  • Bořivoj Melichar
Conference paper

DOI: 10.1007/978-3-642-18098-9_6

Volume 6482 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
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

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.

Keywords

backward pattern matching finite automata theory automata construction approximate pattern matching classification 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jan Antoš
    • 1
  • Bořivoj Melichar
    • 2
  1. 1.Department of Computer Science & Engineering, Faculty of Electrical EngineeringCzech Technical UniversityPrague 2Czech Republic
  2. 2.Department of Theoretical Science, Faculty of Information TechnologyCzech Technical UniversityPrague 6Czech Republic