Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching

Authors:
Jan Holub;Borivoj Melichar
Affiliations:
-;-
Venue:
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Year:
1998

Citing 5
Cited 3

A new approach to text searching

Communications of the ACM
Fast text searching: allowing errors

Communications of the ACM
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
An Improved Algorithm for Approximate String Matching

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
String Matching with Differences by Finite Automata

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

Fast Implementations of Automata Computations

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Bit Parallelism - NFA Simulation

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Viral gene compression: complexity and verification

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are two ways of using the nondeterministic finite automata (NFA). The first one is the transformation to the equivalent deterministic finite automaton and the second one is the simulation of the run of NFA. In this paper we discuss the second way. We present an overview of the simulation methods that have been found in the approximate string matching. We generalize these simulation methods and form the rules for the usage of these methods.