Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <Reverse.h>
Static Public Member Functions | |
template<class SymbolType , class StateType > | |
static automaton::MultiInitialStateNFA< SymbolType, StateType > | convert (const automaton::DFA< SymbolType, StateType > &automaton) |
template<class SymbolType , class StateType > | |
static automaton::MultiInitialStateNFA< SymbolType, StateType > | convert (const automaton::NFA< SymbolType, StateType > &automaton) |
template<class SymbolType , class StateType > | |
static automaton::MultiInitialStateNFA< SymbolType, StateType > | convert (const automaton::MultiInitialStateNFA< SymbolType, StateType > &automaton) |
Transformation of a finite automaton to a reverse finite automaton. For a finite automaton A1 we create a finite automaton A such that L(A) = L(A1)^R (i.e. all strings are reversed).
|
static |
Computation of reverse of a finite automaton.
SymbolType | Type for input symbols. |
StateType | Type for states. |
automaton | the automaton to reverse |
automaton
|
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.