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

#include <ExactMultiNondeterministicSubsequenceAutomaton.h>

Static Public Member Functions

template<class SymbolType >
static automaton::EpsilonNFA< SymbolType, ext::pair< unsigned, unsigned > > construct (const ext::set< string::LinearString< SymbolType > > &texts)
 

Member Function Documentation

◆ construct()

template<class SymbolType >
automaton::EpsilonNFA< SymbolType, ext::pair< unsigned, unsigned > > stringology::indexing::ExactMultiNondeterministicSubsequenceAutomaton::construct ( const ext::set< string::LinearString< SymbolType > > &  texts)
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: