Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Namespaces | Variables
NFTA.h File Reference
#include <ostream>
#include <alib/multimap>
#include <alib/set>
#include <alib/vector>
#include <core/components.hpp>
#include <core/normalize.hpp>
#include <common/DefaultStateType.h>
#include <common/DefaultSymbolType.h>
#include <automaton/AutomatonException.h>
#include <alphabet/common/SymbolNormalize.h>
#include <automaton/common/AutomatonNormalize.h>
#include "DFTA.h"
Include dependency graph for NFTA.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  automaton::NFTA< SymbolTypeT, StateTypeT >
 Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages. More...
 
class  automaton::isNFTA_impl< T >
 
class  automaton::isNFTA_impl< NFTA< SymbolType, StateType > >
 
class  core::SetConstraint< automaton::NFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet >
 
class  core::SetConstraint< automaton::NFTA< SymbolType, StateType >, StateType, automaton::States >
 
class  core::SetConstraint< automaton::NFTA< SymbolType, StateType >, StateType, automaton::FinalStates >
 
struct  core::normalize< automaton::NFTA< SymbolType, StateType > >
 

Namespaces

namespace  automaton
 
namespace  core
 

Variables

template<class T >
constexpr bool automaton::isNFTA = isNFTA_impl < T > { }