Finite automata for generalized approach to backward pattern matching

Authors:
Jan Antoš;Bořivoj Melichar
Affiliations:
Department of Computer Science & Engineering, Faculty of Electrical Engineering, Czech Technical University, Prague 2, Czech Republic;Department of Theoretical Science, Faculty of Information Technology, Czech Technical University, Prague 6, Czech Republic
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 8
Cited 0

A variation on the Boyer-Moore algorithm

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
A fast string searching algorithm

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Factor Oracle: A New Structure for Pattern Matching

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Selected combinatorial research problems.

Selected combinatorial research problems.
Algorithms on Strings

Algorithms on Strings
String Matching with Differences by Finite Automata

ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.