International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 161 - Number 6 |
Year of Publication: 2017 |
Authors: Ashish Kumar Pandey, Amit Sinha |
10.5120/ijca2017913212 |
Ashish Kumar Pandey, Amit Sinha . Streamlining of DFA based Pattern Matchers. International Journal of Computer Applications. 161, 6 ( Mar 2017), 10-13. DOI=10.5120/ijca2017913212
This paper presents an efficient algorithm for finding matches to a given regular expression in given text using optimization of DFA. To match a regular expression of length n, a serial machine requires 0(2^n) memory and takes 0(1) time per text character. The proposed approach requires only 0(n^2) space and still process a text character in 0(1) time (one clock cycle).The improvement is due to the optimization of DFA that means without converting it into the NFA, directly convert into the DFA. Finite Automaton (DFA) used to perform the matching. Furthermore, the paper presents a simple, fast algorithm that quickly constructs the DFA for the given regular expression.