Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <ostream>
#include <alib/multimap>
#include <alib/set>
#include <ext/algorithm>
#include <core/components.hpp>
#include <common/createUnique.hpp>
#include <common/DefaultStateType.h>
#include <common/DefaultSymbolType.h>
#include <label/InitialStateLabel.h>
#include <regexp/unbounded/UnboundedRegExpStructure.h>
#include <regexp/unbounded/UnboundedRegExpConcatenation.h>
#include <regexp/unbounded/UnboundedRegExpSymbol.h>
#include <automaton/AutomatonException.h>
#include <core/normalize.hpp>
#include <alphabet/common/SymbolNormalize.h>
#include <automaton/common/AutomatonNormalize.h>
#include "DFA.h"
#include "NFA.h"
#include "CompactNFA.h"
#include "EpsilonNFA.h"
#include "MultiInitialStateNFA.h"
Go to the source code of this file.
Data Structures | |
class | automaton::ExtendedNFA< SymbolTypeT, StateTypeT > |
Extended nondeterministic finite automaton. Accepts regular languages. The automaton has a regular expression on transitions. More... | |
class | automaton::isExtendedNFA_impl< T > |
class | automaton::isExtendedNFA_impl< ExtendedNFA< SymbolType, StateType > > |
class | core::SetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > |
class | core::SetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::States > |
class | core::SetConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::FinalStates > |
class | core::ElementConstraint< automaton::ExtendedNFA< SymbolType, StateType >, StateType, automaton::InitialState > |
struct | core::normalize< automaton::ExtendedNFA< SymbolType, StateType > > |
Namespaces | |
namespace | automaton |
namespace | core |
Variables | |
template<class T > | |
constexpr bool | automaton::isExtendedNFA = isExtendedNFA_impl < T > { } |