ReachableStates.h File Reference

#include <ext/algorithm>
#include <alib/deque>
#include <alib/set>
#include <alib/map>
#include <automaton/FSM/ExtendedNFA.h>
#include <automaton/FSM/CompactNFA.h>
#include <automaton/FSM/EpsilonNFA.h>
#include <automaton/FSM/NFA.h>
#include <automaton/FSM/DFA.h>
#include <automaton/TA/DFTA.h>
#include <automaton/TA/NFTA.h>
#include <automaton/TA/ArcFactoredDeterministicZAutomaton.h>
#include <automaton/TA/ArcFactoredNondeterministicZAutomaton.h>

Include dependency graph for ReachableStates.h:

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

Go to the source code of this file.

Data Structures
class	automaton::properties::ReachableStates

Namespaces
namespace	automaton
namespace	automaton::properties

Typedefs
template<class T >
using	automaton::properties::SymbolType = typename T::SymbolType

Functions
Qi	automaton::properties::push_back (ext::set< StateType >())
Qi	automaton::properties::at (0).insert(fsm.getInitialState()) = fsm.getInitialStates( )
Qi	automaton::properties::push_back (Qi.at(i - 1))
return Qi	automaton::properties::at (i)
	automaton::properties::for (const auto &transition :afza.getTransitions())

Variables
template<class T > requires isMultiInitialStateNFA < T > || isMultiInitialStateEpsilonNFA < T > ext::set < typename T::StateType > ReachableStates::reachableStates( const T & fsm )
ext::deque< ext::set< StateType > >	automaton::properties::Qi
	automaton::properties::do
for(const auto &p :Qi.at(i - 1)) for(const auto &transition	automaton::properties::while (Qi.at(i) !=Qi.at(i - 1))