9#include <string/LinearString.h>
21 template <
class SymbolType >
25template <
class SymbolType >
30 res.addTransition( 0, symbol, 0);
35 res.addTransition(
i - 1, symbol,
i );
38 res.addFinalState(
i - 1 );
Nondeterministic finite automaton. Accepts regular languages.
Definition: NFA.h:66
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: ExactMatchingAutomaton.h:15
static automaton::NFA< SymbolType, unsigned > construct(const string::LinearString< SymbolType > &pattern)
Definition: ExactMatchingAutomaton.h:26
int i
Definition: AllEpsilonClosure.h:118
typename T::SymbolType SymbolType
Definition: ReachableStates.h:176
return res
Definition: MinimizeByPartitioning.h:145
Definition: ArithmeticCompression.h:18