|
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 <automaton/AutomatonException.h>#include <core/normalize.hpp>#include <alphabet/common/SymbolNormalize.h>#include <automaton/common/AutomatonNormalize.h>#include "MultiInitialStateEpsilonNFA.h"#include "EpsilonNFA.h"#include "MultiInitialStateNFA.h"#include "NFA.h"#include "CompactDFA.h"#include "DFA.h"Go to the source code of this file.
Data Structures | |
| class | automaton::CompactNFA< SymbolTypeT, StateTypeT > |
| Compact nondeterministic finite automaton. Accepts regular languages. The automaton has a list of symbols on transitions. More... | |
| class | automaton::isCompactNFA_impl< T > |
| class | automaton::isCompactNFA_impl< CompactNFA< SymbolType, StateType > > |
| class | core::SetConstraint< automaton::CompactNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet > |
| class | core::SetConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::States > |
| class | core::SetConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::FinalStates > |
| class | core::ElementConstraint< automaton::CompactNFA< SymbolType, StateType >, StateType, automaton::InitialState > |
| struct | core::normalize< automaton::CompactNFA< SymbolType, StateType > > |
Namespaces | |
| namespace | automaton |
| namespace | core |
Variables | |
| template<class T > | |
| constexpr bool | automaton::isCompactNFA = isCompactNFA_impl < T > { } |