Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <SingleInitialStateEpsilonTransition.h>
Static Public Member Functions | |
template<class T > requires isMultiInitialStateNFA < T > || isMultiInitialStateEpsilonNFA < T > | |
static automaton::EpsilonNFA< typename T::StateType, typename T::SymbolType > | convert (const T &fsm) |
template<class T > requires isDFA < T > || isNFA < T > || isEpsilonNFA < T > || isExtendedNFA < T > || isCompactNFA < T > | |
static T | convert (const T &fsm) |
Algorithm for the conversion of multi-initial state finite automata to single-initial state finite automata using epsilon transitions.
|
static |
Converts multi-initial state automaton to a single-initial state automaton with the use of epsilon transitions.
T | type of the converted automaton. |
automaton | automaton to convert |
with
only one initial state
|
static |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.