13#include <string/LinearString.h>
25 template <
class SymbolType >
30template <
class SymbolType >
45 return nfaSuffixAutomaton;
Epsilon nondeterministic finite automaton. Accepts regular languages.
Definition: EpsilonNFA.h:74
bool addTransition(StateType from, common::symbol_or_epsilon< SymbolType > input, StateType to)
Add a transition to the automaton.
Definition: EpsilonNFA.h:604
void setInputAlphabet(ext::set< SymbolType > symbols)
Definition: EpsilonNFA.h:294
bool addFinalState(StateType state)
Definition: EpsilonNFA.h:227
bool addState(StateType state)
Definition: EpsilonNFA.h:178
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
Definition: NondeterministicExactSuffixEpsilonAutomaton.h:19
static automaton::EpsilonNFA< SymbolType, unsigned > construct(const string::LinearString< SymbolType > &pattern)
Definition: NondeterministicExactSuffixEpsilonAutomaton.h:31
int i
Definition: AllEpsilonClosure.h:118
typename T::SymbolType SymbolType
Definition: ReachableStates.h:176
Definition: ArithmeticCompression.h:18