Fast text searching: allowing errors
Communications of the ACM
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Instruction Computation in Subset Construction
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Implementing WS1S via Finite Automata: Performance Issues
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Compact DFA Representation for Fast Regular Expression Search
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Mastering Regular Expressions
| Hi-index | 0.00 |
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of determinization. There exist solutions to control the space and time complexity like the so called “on the fly” determinization. Another solution consists in performing brute force determinization, which is robust and technically fast, although a priori its space complexity constitutes a weakness. However, one can reduce this complexity by perfoming a partial brute force determinization. This paper provides optimizations that consist in detecting classes of unreachable states and transitions of the subset automaton, which leads in average to an exponential reduction of the complexity of brute force and partial brute force determinization.