13#include <string/LinearString.h>
32 template <
class SymbolType >
37template <
class SymbolType >
40 reverse ( patternData.begin ( ), patternData.end ( ) );
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
Epsilon nondeterministic finite automaton. Accepts regular languages.
Definition: EpsilonNFA.h:74
static automaton::DFA< SymbolType, StateType > determinize(const automaton::DFA< SymbolType, StateType > &automaton)
Definition: Determinize.h:276
static automaton::NFA< SymbolType, StateType > remove(const automaton::EpsilonNFA< SymbolType, StateType > &fsm)
Definition: EpsilonRemoverIncoming.h:96
static automaton::DFA< SymbolType, StateType > minimize(const automaton::DFA< SymbolType, StateType > &dfa)
Definition: Minimize.h:62
static Rename::RenamedAutomaton< T > rename(const T &fsm)
Suffix automaton string index. Automaton representation of all suffixes. The automaton is general det...
Definition: SuffixAutomaton.h:50
Linear string.
Definition: LinearString.h:57
const ext::set< SymbolType > & getAlphabet() const &
Definition: LinearString.h:103
const ext::vector< SymbolType > & getContent() const &
Definition: LinearString.h:238
static automaton::EpsilonNFA< SymbolType, unsigned > construct(const string::LinearString< SymbolType > &pattern)
Definition: NondeterministicExactSuffixEpsilonAutomaton.h:31
Definition: NaiveDAWGMatcherConstruction.h:26
static indexes::stringology::SuffixAutomaton< SymbolType > naiveConstruct(const string::LinearString< SymbolType > &pattern)
Definition: NaiveDAWGMatcherConstruction.h:38
return res
Definition: MinimizeByPartitioning.h:145
Definition: ArithmeticCompression.h:18