Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <ext/algorithm>
#include <alib/map>
#include <alib/vector>
#include <automaton/FSM/DFA.h>
#include <automaton/FSM/NFA.h>
#include <automaton/FSM/EpsilonNFA.h>
#include <automaton/TA/DFTA.h>
#include <automaton/TA/NFTA.h>
#include <automaton/TA/ArcFactoredNondeterministicZAutomaton.h>
#include <automaton/TA/ArcFactoredDeterministicZAutomaton.h>
#include <automaton/PDA/DPDA.h>
#include <automaton/PDA/NPDA.h>
#include <automaton/PDA/InputDrivenDPDA.h>
#include <automaton/PDA/RealTimeHeightDeterministicDPDA.h>
#include <automaton/PDA/SinglePopDPDA.h>
#include <automaton/PDA/VisiblyPushdownDPDA.h>
Go to the source code of this file.
Data Structures | |
class | automaton::simplify::Rename |
Namespaces | |
namespace | automaton |
namespace | automaton::simplify |
Functions | |
result | automaton::simplify::setInputAlphabet (fsm.getInputAlphabet()) |
automaton::simplify::for (const StateType &state :fsm.getStates()) result.addState(renamingData.at(state)) | |
automaton::simplify::for (const auto &transition :fsm.getTransitions()) result.addTransition(renamingData.at(transition.first.first) | |
transition first statePartitionMap | automaton::simplify::at (transition.second)) |
result | automaton::simplify::setInputAlphabet (fta.getInputAlphabet()) |
automaton::simplify::for (const StateType &state :fta.getStates()) result.addState(renamingData.at(state)) | |
automaton::simplify::for (const auto &transition :fta.getTransitions()) | |
Variables | |
template<class T > requires isDFTA < T > || isNFTA < T > Rename::RenamedTreeAutomaton < T > Rename::rename ( const T & fta ) | |
unsigned | automaton::simplify::counter = 0 |
ext::map< StateType, unsigned > | automaton::simplify::renamingData |
for(const StateType &state :fsm.getStates()) renamingData.insert(std Rename::RenamedAutomaton< T > | automaton::simplify::result (renamingData.at(fsm.getInitialState())) |