Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <AutomatonIteration.h>
Static Public Member Functions | |
template<class Automaton > requires isDFA < Automaton > || isNFA < Automaton > | |
static automaton::NFA< typename Automaton::SymbolType, typename Automaton::StateType > | iteration (const Automaton &automaton) |
Iteration of a finite automaton. 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.82).
|
static |
Iteration of a finite automaton.
SymbolType | Type for input symbols. |
StateType | Type for states. |
automaton | automaton to iterate |
automaton
accepted" );