Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
stringology::matching::NaiveDAWGMatcherConstruction Class Reference

#include <NaiveDAWGMatcherConstruction.h>

Static Public Member Functions

template<class SymbolType >
static indexes::stringology::SuffixAutomaton< SymbolType > naiveConstruct (const string::LinearString< SymbolType > &pattern)
 

Member Function Documentation

◆ naiveConstruct()

template<class SymbolType >
indexes::stringology::SuffixAutomaton< SymbolType > stringology::matching::NaiveDAWGMatcherConstruction::naiveConstruct ( const string::LinearString< SymbolType > &  pattern)
static

Naive construction of minimal suffix automaton for given pattern - EpsNFA -> NFA -> DFA -> minDFA -> removeErrorState.

Returns
minimal suffix automaton for given pattern.
Here is the call graph for this function:

The documentation for this class was generated from the following file: