Dynamic programming: NFA simulation

Authors:
Jan Holub
Affiliations:
Department of Computer Science and Engineering, Czech Technical University, Czech Republic
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 6
Cited 1

Automata and Computability

Automata and Computability
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
Bit Parallelism - NFA Simulation

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
A Faster Algorithm for Approximate String Matching

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Approximate String Matching by Finite Automata

CAIP '95 Proceedings of the 6th International Conference on Computer Analysis of Images and Patterns

Approximate regular expressions and their derivatives

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nondeterministic finite automaton (NFA) cannot be directly used because of its nondeterminism. One way how to use NFA is to determinize NFA and the second way is to use one of simulation methods. This paper deals with one of the simulation method called dynamic programming. We present the method on one of the pattern matching problems as well as modifications for several other tasks.