Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#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/ArcFactoredDeterministicZAutomaton.h>
#include <automaton/TA/ArcFactoredNondeterministicZAutomaton.h>
#include <automaton/TA/DFTA.h>
#include <automaton/TA/NFTA.h>
Go to the source code of this file.
Data Structures | |
class | automaton::properties::UsefulStates |
Namespaces | |
namespace | automaton |
namespace | automaton::properties |
Functions | |
Qi | automaton::properties::push_back (ext::set< StateType >()) |
Qi | automaton::properties::at (0).insert(fsm.getInitialState()) = fsm.getInitialStates( ) |
automaton::properties::while (true) | |
return Qi | automaton::properties::at (i) |
Qi | automaton::properties::push_back (Qi.at(i - 1)) |
automaton::properties::for (const auto &p :Qi.at(i - 1)) for(const auto &t | |
Variables | |
for(const auto &p :Qi.at(i - 1)) for(const auto &transition | automaton::properties::while (Qi.at(i) !=Qi.at(i - 1)) |