Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <alib/set>
#include <alib/map>
#include <alib/deque>
#include <automaton/FSM/ExtendedNFA.h>
#include <automaton/FSM/CompactNFA.h>
#include <automaton/FSM/EpsilonNFA.h>
#include <automaton/FSM/MultiInitialStateNFA.h>
#include <automaton/FSM/NFA.h>
#include <automaton/FSM/DFA.h>
#include <automaton/TA/NondeterministicZAutomaton.h>
#include <automaton/TA/EpsilonNFTA.h>
#include <regexp/properties/RegExpEpsilon.h>
Go to the source code of this file.
Data Structures | |
class | automaton::properties::AllEpsilonClosure |
Namespaces | |
namespace | automaton |
namespace | automaton::properties |
Functions | |
template<class T > requires isEpsilonNFA < T > || isEpsilonNFTA < T > ext::map < typename T::StateType, ext::set < typename T::StateType > > AllEpsilonClosure::allEpsilonClosure( const T & fsm) | |
Qi | automaton::properties::push_back ({ }) |
automaton::properties::for (const typename T::StateType &state :fsm.getStates()) Qi.at(0)[state].insert(state) | |
automaton::properties::while (true) | |
return Qi | automaton::properties::at (i) |
Variables | |
int | automaton::properties::i = 1 |
return | automaton::properties::closure |