|
| template<class SymbolType , class StateType > |
| static regexp::UnboundedRegExp< SymbolType > | convert (const automaton::DFA< SymbolType, StateType > &automaton) |
| |
| template<class SymbolType , class StateType > |
| static regexp::UnboundedRegExp< SymbolType > | convert (const automaton::NFA< SymbolType, StateType > &automaton) |
| |
| template<class SymbolType , class StateType > |
| static regexp::UnboundedRegExp< SymbolType > | convert (const automaton::MultiInitialStateNFA< SymbolType, StateType > &automaton) |
| |
| template<class SymbolType , class StateType > |
| static regexp::UnboundedRegExp< SymbolType > | convert (const automaton::MultiInitialStateEpsilonNFA< SymbolType, StateType > &automaton) |
| |
| template<class SymbolType , class StateType > |
| static regexp::UnboundedRegExp< SymbolType > | convert (const automaton::EpsilonNFA< SymbolType, StateType > &automaton) |
| |
Converts a finite automaton to a regular expression using using the algorithm from Kleene Theorem (Hopcroft 2nd edition: 3.2.1 - Th 3.4). This algorithm returns the regular expression as regexp::UnboundedRegExp.