9#include <string/LinearString.h>
23 template <
class SymbolType >
27template <
class SymbolType >
34 res.addInputSymbols ( text.getAlphabet ( ) );
41 for (
const SymbolType & symbol : text.getContent ( ) ) {
Epsilon nondeterministic finite automaton. Accepts regular languages.
Definition: EpsilonNFA.h:74
Linear string.
Definition: LinearString.h:57
Definition: ExactMultiNondeterministicSubsequenceAutomaton.h:17
static automaton::EpsilonNFA< SymbolType, ext::pair< unsigned, unsigned > > construct(const ext::set< string::LinearString< SymbolType > > &texts)
Definition: ExactMultiNondeterministicSubsequenceAutomaton.h:28
int i
Definition: AllEpsilonClosure.h:118
typename T::SymbolType SymbolType
Definition: ReachableStates.h:176
return res
Definition: MinimizeByPartitioning.h:145
constexpr auto make_pair(T1 &&x, T2 &&y)
Definition: pair.hpp:79
Definition: ArithmeticCompression.h:18