Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <automaton/FSM/EpsilonNFA.h>
Go to the source code of this file.
Data Structures | |
class | automaton::transform::AutomatonIteration |
Namespaces | |
namespace | automaton |
namespace | automaton::transform |
Functions | |
res | automaton::transform::addState (newInitialState) |
automaton::transform::for (const auto &t :automaton.getTransitionsFromState(automaton.getInitialState())) | |
res | automaton::transform::addFinalState (newInitialState) |
Variables | |
template<class Automaton > | |
Automaton::StateType | automaton::transform::newInitialState = common::createUnique(automaton.getInitialState(), automaton.getStates()) |
for(const auto &qf :res.getFinalStates()) for(const auto &t res | automaton::transform::setInitialState (newInitialState) |