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

#include <ExactMatchingAutomaton.h>

Static Public Member Functions

template<class SymbolType >
static automaton::NFA< SymbolType, unsigned > construct (const string::LinearString< SymbolType > &pattern)
 

Member Function Documentation

◆ construct()

template<class SymbolType >
automaton::NFA< SymbolType, unsigned > stringology::matching::ExactMatchingAutomaton::construct ( const string::LinearString< SymbolType > &  pattern)
static

Performs conversion.

Returns
left regular grammar equivalent to source automaton.
Here is the call graph for this function:

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