This page contains the Dga Package documentation.
Bases: netbench.pattern_match.b_dfa.b_dfa
Class for Deterministic Generalized Automata.
A generalized automaton (GA) is a finite automaton where the single transitions are defined on words rather than on single letters.
This method computes Deterministic Generalized Automata.
Raises: | COMPUTE_ERROR |
---|
This function will find patterns in the given string.
Parameters: |
|
---|---|
Returns: | Bitmap of matched regular expressions. |
Return type: | list(int) |