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.
Cite
CITATION STYLE
Holub, J., & Melichar, B. (1999). Implementation of nondeterministic finite automata for approximate pattern matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1660, pp. 92–99). Springer Verlag. https://doi.org/10.1007/3-540-48057-9_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
