Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Namespaces | Functions | Variables
ToRegExpAlgebraic.h File Reference
#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>
Include dependency graph for ToRegExpAlgebraic.h:
This graph shows which files directly or indirectly include this file:

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
 
automaton::convert::second