Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <AutomataConcatenationEpsilonTransition.h>
Static Public Member Functions | |
template<class SymbolType , class StateType > | |
static automaton::EpsilonNFA< SymbolType, ext::pair< StateType, unsigned > > | concatenation (const automaton::DFA< SymbolType, StateType > &first, const automaton::DFA< SymbolType, StateType > &second) |
template<class SymbolType , class StateType > | |
static automaton::EpsilonNFA< SymbolType, ext::pair< StateType, unsigned > > | concatenation (const automaton::NFA< SymbolType, StateType > &first, const automaton::NFA< SymbolType, StateType > &second) |
template<class SymbolType , class StateType > | |
static automaton::EpsilonNFA< SymbolType, ext::pair< StateType, unsigned > > | concatenation (const automaton::EpsilonNFA< SymbolType, StateType > &first, const automaton::EpsilonNFA< SymbolType, StateType > &second) |
Concatenation of two finite automata. For finite automata A1, A2, we create a finite automaton A such that L(A) = L(A1).L(A2). This method utilizes epsilon transitions in the resulting finite automata (Melichar: Jazyky a překlady, 2.80).
|
static |
Concatenates two automata using epsilon transitions.
SymbolType | Type for input symbols. |
StateType | Type for states. |
first | First automaton (A1) |
second | Second automaton (A2) |
|
static |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
static |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.