Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <EpsilonRemoverIncoming.h>
Static Public Member Functions | |
template<class SymbolType , class StateType > | |
static automaton::NFA< SymbolType, StateType > | remove (const automaton::EpsilonNFA< SymbolType, StateType > &fsm) |
template<class SymbolType , class StateType > | |
static automaton::MultiInitialStateNFA< SymbolType, StateType > | remove (const automaton::MultiInitialStateNFA< SymbolType, StateType > &fsm) |
template<class SymbolType , class StateType > | |
static automaton::NFA< SymbolType, StateType > | remove (const automaton::NFA< SymbolType, StateType > &fsm) |
template<class SymbolType , class StateType > | |
static automaton::DFA< SymbolType, StateType > | remove (const automaton::DFA< SymbolType, StateType > &fsm) |
Removes epsilon transitions from an automaton. This method is the one teached at BI-AAG course.
|
static |
For deterministic finite automata, we remove nothing and return the res
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
static |
Removes epsilon transitions from an automaton.
SymbolType | Type for input symbols. |
StateType | Type for states. |
res | automaton to remove epsilon transitions from |
res
but without epsilon transitions Step 1 from Melichar 2.41
Step 2 from Melichar 2.41
|
static |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
static |
For nondeterministic finite automata, we remove nothing and return the res
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.