Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <MinimizeBrzozowski.h>
Static Public Member Functions | |
template<class SymbolType , class StateType > | |
static automaton::DFA< SymbolType, ext::set< ext::set< StateType > > > | minimize (const automaton::DFA< SymbolType, StateType > &dfa) |
template<class SymbolType , class StateType > | |
static automaton::DFA< SymbolType, ext::set< ext::set< StateType > > > | minimize (const automaton::NFA< SymbolType, StateType > &nfa) |
Minimization of finite automata.
For finite automata, we implement Brzozowski's method. This method works also for the minimization of NFA to minimal DFA.
Implements: Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events (1962)
|
static |
Minimizes the given automaton using Brzozowski's method.
SymbolType | Type for input symbols. |
StateType | Type for states. |
dfa | finite automaton to minimize. |
dfa
|
static |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.