|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <regexp/unbounded/UnboundedRegExp.h>#include <automaton/FSM/DFA.h>#include <automaton/FSM/NFA.h>#include <automaton/FSM/MultiInitialStateNFA.h>#include <automaton/FSM/EpsilonNFA.h>#include <equations/RightRegularEquationSolver.h>#include <regexp/unbounded/UnboundedRegExpElements.h>Go to the source code of this file.
Data Structures | |
| class | automaton::convert::ToRegExpAlgebraic |
Namespaces | |
| namespace | automaton |
| namespace | automaton::convert |
Functions | |
| solver | automaton::convert::setVariableSymbols (automaton.getStates()) |
| automaton::convert::for (const StateType &q :automaton.getFinalStates()) solver.addEquation(q | |
| automaton::convert::for (const auto &p :automaton.getTransitions()) solver.addEquation(p.first.first | |
| return solver | automaton::convert::solve (automaton.getInitialState()) |
Variables | |
| equations::RightRegularEquationSolver< SymbolType, StateType > | automaton::convert::solver |
| p | automaton::convert::second |