59 template <
class SymbolType,
class StateType >
65 template <
class SymbolType,
class StateType >
69template <
class SymbolType,
class StateType >
74template <
class SymbolType,
class StateType >
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
Nondeterministic finite automaton. Accepts regular languages.
Definition: NFA.h:66
static automaton::DFA< SymbolType, StateType > determinize(const automaton::DFA< SymbolType, StateType > &automaton)
Definition: Determinize.h:276
Definition: MinimizeBrzozowski.h:47
static automaton::DFA< SymbolType, ext::set< ext::set< StateType > > > minimize(const automaton::DFA< SymbolType, StateType > &dfa)
Definition: MinimizeBrzozowski.h:70
Definition: ToGrammar.h:31