9#include <string/LinearString.h>
21 template <
class SymbolType >
25template <
class SymbolType >
33 res.addFinalState ( 0 );
39 res.addFinalState (
i );
41 for (
unsigned j = f [ symbol ]; j <
i; j++ ) {
42 res.addTransition ( j, symbol,
i );
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
Class extending the map class from the standard library. Original reason is to allow printing of the ...
Definition: map.hpp:48
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: ExactSubsequenceAutomaton.h:15
static automaton::DFA< SymbolType, unsigned > construct(const string::LinearString< SymbolType > &text)
Definition: ExactSubsequenceAutomaton.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