Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Namespaces
EpsilonNFA.h File Reference
#include <ostream>
#include <alib/multimap>
#include <alib/set>
#include <core/components.hpp>
#include <common/createUnique.hpp>
#include <common/DefaultStateType.h>
#include <common/DefaultSymbolType.h>
#include <common/symbol_or_epsilon.hpp>
#include <label/InitialStateLabel.h>
#include <automaton/AutomatonException.h>
#include <core/normalize.hpp>
#include <alphabet/common/SymbolNormalize.h>
#include <automaton/common/AutomatonNormalize.h>
#include "MultiInitialStateNFA.h"
#include "NFA.h"
#include "DFA.h"
Include dependency graph for EpsilonNFA.h:

Go to the source code of this file.

Data Structures

class  automaton::EpsilonNFA< SymbolTypeT, StateTypeT >
 Epsilon nondeterministic finite automaton. Accepts regular languages. More...
 
class  automaton::isEpsilonNFA_impl< T >
 
class  automaton::isEpsilonNFA_impl< EpsilonNFA< SymbolType, StateType > >
 
class  core::SetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
 
class  core::SetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::States >
 
class  core::SetConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::FinalStates >
 
class  core::ElementConstraint< automaton::EpsilonNFA< SymbolType, StateType >, StateType, automaton::InitialState >
 
struct  core::normalize< automaton::EpsilonNFA< SymbolType, StateType > >
 

Namespaces

namespace  automaton
 
namespace  core
 

Variables

template<class T >
constexpr bool automaton::isEpsilonNFA = isEpsilonNFA_impl < T > { }