MinimizeByPartitioning.h File Reference

#include <alib/set>
#include <alib/map>
#include <automaton/FSM/DFA.h>
#include <automaton/FSM/NFA.h>
#include <automaton/TA/DFTA.h>
#include <automaton/TA/NFTA.h>
#include <automaton/TA/UnorderedDFTA.h>
#include <automaton/TA/UnorderedNFTA.h>

Include dependency graph for MinimizeByPartitioning.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
class	automaton::simplify::MinimizeByPartitioning

Namespaces
namespace	automaton
namespace	automaton::simplify

Functions
MinimizeByPartitioning::FA< T >	automaton::simplify::res (statePartitionMap.at(nfa.getInitialState()))
res	automaton::simplify::setStates (partitions)
res	automaton::simplify::addInputSymbols (nfa.getInputAlphabet())
	automaton::simplify::for (const StateType &state :nfa.getFinalStates()) res.addFinalState(statePartitionMap.at(state))
	automaton::simplify::for (const auto &transition :nfa.getTransitions()) res.addTransition(statePartitionMap.at(transition.first.first)
transition first statePartitionMap	automaton::simplify::at (transition.second))
res	automaton::simplify::addInputSymbols (dfta.getInputAlphabet())
	automaton::simplify::for (const StateType &state :dfta.getFinalStates()) res.addFinalState(statePartitionMap.at(state))
	automaton::simplify::for (const auto &transition :dfta.getTransitions())

Variables
template<class T > requires isDFTA < T > || isNFTA < T > MinimizeByPartitioning::FTA < T > MinimizeByPartitioning::minimize ( const T & dfta, const ext::set < ext::set < typename T::StateType > > & partitions )
const ext::map< StateType, ext::set< StateType > >	automaton::simplify::statePartitionMap = partitionMap ( partitions )
transition first	automaton::simplify::second
return	automaton::simplify::res