Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching

  • Jan Holub
  • Bořivoj Melichar
Conference paper

DOI: 10.1007/3-540-48057-9_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1660)
Cite this paper as:
Holub J., Melichar B. (1999) Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. In: Champarnaud JM., Ziadi D., Maurel D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Jan Holub
    • 1
  • Bořivoj Melichar
    • 1
  1. 1.Department of Computer Science and EngineeringCzech Technical UniversityPrague 2Czech Republic

Personalised recommendations