A New Approach to Determinisation Using Bit-Parallelism
We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively.
- [Döm64]Dömölki, B.: An algorithm for syntactic analysis. Computational Linguistics 8, 29–46 (1964)Google Scholar
- [Hol00]Holub, J.: Simulation of Nondeterministic Finite Automata in Pattern Matching. Ph.D. Thesis, Czech Technical University in Prague (February 2000)Google Scholar