|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <stack>#include <alib/tuple>#include <automaton/FSM/CompactDFA.h>#include <automaton/FSM/CompactNFA.h>#include <automaton/FSM/NFA.h>#include <automaton/FSM/DFA.h>Go to the source code of this file.
Data Structures | |
| class | automaton::transform::Compaction |
Namespaces | |
| namespace | automaton |
| namespace | automaton::transform |
Typedefs | |
| template<class T > | |
| using | automaton::transform::StateType = typename T::StateType |
Functions | |
| CompactAutomaton< T > | automaton::transform::res (automaton.getInitialState()) |
| res | automaton::transform::setInputAlphabet (automaton.getInputAlphabet()) |
| automaton::transform::while (!stack.empty()) | |
Variables | |
| ext::set< ext::tuple< StateType, StateType, SymbolType > > | automaton::transform::visited |
| std::stack< ext::tuple< StateType, StateType, SymbolType > > | automaton::transform::stack |
| for(const auto &transition:automaton.getTransitionsFromState(automaton.getInitialState())) stack.push(ext | automaton::transform::if (automaton.getFinalStates().count(automaton.getInitialState())) res.addFinalState(automaton.getInitialState()) |