Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <AutomatonIterationEpsilonTransition.h>
Static Public Member Functions | |
template<class T > | |
static automaton::EpsilonNFA< typename T::SymbolType, typename T::StateType > | iteration (const T &automaton) |
Iteration of a finite automaton using epsilon transitions. For finite automaton A1, we create automaton A such that L(A) = L(A1)* This method utilizes epsilon transitions in finite automata (Melichar: Jazyky a překlady, 2.84).
|
static |
Iteration of a finite automaton using epsilon transitions.
T | Type of the finite automaton. |
automaton | automaton to iterate |
automaton