|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <automaton/FSM/DFA.h>#include <automaton/FSM/NFA.h>#include <automaton/FSM/MultiInitialStateNFA.h>#include <automaton/FSM/MultiInitialStateEpsilonNFA.h>#include <automaton/FSM/ExtendedNFA.h>#include <automaton/FSM/EpsilonNFA.h>#include <automaton/FSM/CompactNFA.h>#include <label/InitialStateLabel.h>#include <common/createUnique.hpp>Go to the source code of this file.
Data Structures | |
| class | automaton::simplify::SingleInitialStateEpsilonTransition |
Namespaces | |
| namespace | automaton |
| namespace | automaton::simplify |
Typedefs | |
| template<class T > | |
| using | automaton::simplify::SymbolType = typename T::SymbolType |
Functions | |
| SingleInitialState::ConvertedAutomaton< T > | automaton::simplify::res (q0) |
| result | automaton::simplify::setInputAlphabet (fsm.getInputAlphabet()) |
| automaton::simplify::for (const StateType &q :fsm.getStates()) res.addState(q) | |
| automaton::simplify::for (const auto &q :fsm.getInitialStates()) res.addTransition(q0 | |
| res | automaton::simplify::setFinalStates (fsm.getFinalStates()) |
Variables | |
| automaton::simplify::q | |
| for(const auto &q :fsm.getInitialStates()) for(const auto &kv | automaton::simplify::for (const auto &t :fsm.getTransitions()) res.addTransition(t.first.first |