Bit Parallelism - NFA Simulation

Authors:
Jan Holub
Affiliations:
-
Venue:
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Year:
2001

Citing 8
Cited 1

Generalized string matching

SIAM Journal on Computing
A new approach to text searching

Communications of the ACM
Fast text searching: allowing errors

Communications of the ACM
Automata and Computability

Automata and Computability
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Multiple Approximate String Matching

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching

WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
A Faster Algorithm for Approximate String Matching

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching

Dynamic programming: NFA simulation

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with one of possibilities of use of nondeterministic finite automaton (NFA)--simulation of NFA using the method called bit parallelism. After a short presentation of the basic simulation method, the bit parallelism is presented on one of the pattern matching problems. Then a flexibility of the bit parallelism is demonstrated by a simulation of NFAs for other pattern matching problems.