This page contains the Delay_Dfa Package documentation.
Module for pattern match: algorithm for Delayed Input DFA.
Bases: netbench.pattern_match.b_dfa.b_dfa
Class for Delayed Input DFA automat.
Delayed Input DFA substantially reduces space requirements as compared to a DFA. DDFA is constructed by transforming a DFA via incrementally replacing several transitions of the automaton with a single default transition. A DDFA represents reduces transitions by more than 95%.
This method creates the file which represents the Delay DFA automat. This file will be input into algorithm written in C language.
Parameter: | FileName (string) – Name of file into which Delay DFA automat representation will be saved. |
---|
This method computes Delayed Input DFA automat.
Parameter: | c_dfa (bool) – compute DFA(Delault is true,so compute() is called to create DFA) |
---|---|
Raises: | COMPUTE_ERROR |
This method returns the number of default transitions in Delay DFA automaton.
Returns: | number of default transitions |
---|---|
Return type: | int |
This function will find patterns in the given string.
Parameters: |
|
---|---|
Returns: | Bitmap of matched regular expressions. |
Return type: | list(int) |
This method sets diameter bound.
Parameter: | d_b (int) – diameter bound |
---|
Default is zero, which means no limit in construction of Delay DFA.