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

Go to the source code of this file.

Data Structures

class  automaton::NFA< SymbolTypeT, StateTypeT >
 Nondeterministic finite automaton. Accepts regular languages. More...
 
class  automaton::isNFA_impl< T >
 
class  automaton::isNFA_impl< NFA< SymbolType, StateType > >
 
class  core::SetConstraint< automaton::NFA< SymbolType, StateType >, SymbolType, automaton::InputAlphabet >
 
class  core::SetConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::States >
 
class  core::SetConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::FinalStates >
 
class  core::ElementConstraint< automaton::NFA< SymbolType, StateType >, StateType, automaton::InitialState >
 
struct  core::normalize< automaton::NFA< SymbolType, StateType > >
 

Namespaces

namespace  automaton
 
namespace  core
 

Variables

template<class T >
constexpr bool automaton::isNFA = isNFA_impl < T > { }