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

#include <ExactSubsequenceAutomaton.h>

Static Public Member Functions

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

Member Function Documentation

◆ construct()

template<class SymbolType >
automaton::DFA< SymbolType, unsigned > stringology::indexing::ExactSubsequenceAutomaton::construct ( const string::LinearString< SymbolType > &  text)
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: