Dga Documentation

This page contains the Dga Package documentation.

The dga Module

class netbench.pattern_match.algorithms.experimental.dga.dga.DGA

Bases: netbench.pattern_match.b_dfa.b_dfa

Class for Deterministic Generalized Automata.

Based on:
“Algorithms to accelerate multiple regular expressions matching for deep packet inspection” ISBN: 1-59593-308-5 URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.7243

A generalized automaton (GA) is a finite automaton where the single transitions are defined on words rather than on single letters.

compute()

This method computes Deterministic Generalized Automata.

Raises:COMPUTE_ERROR
search(input_string)

This function will find patterns in the given string.

Parameters:
  • input_string – Input string.
  • input_string – string
Returns:

Bitmap of matched regular expressions.

Return type:

list(int)

show(fileName, sizeStr=' size="8, 5"n')
This method can’t be used.

The test_dga Module

class netbench.pattern_match.algorithms.experimental.dga.test_dga.test_dga(methodName='runTest')

Bases: unittest.TestCase

test_compute()
compute()
search()

Table Of Contents

Previous topic

Experimental Documentation

Next topic

Nfa_Split Documentation

This Page