UnorderedDFTA.h File Reference

#include <ostream>
#include <alib/map>
#include <alib/set>
#include <alib/multiset>
#include <core/components.hpp>
#include <common/ranked_symbol.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 dependency graph for UnorderedDFTA.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
class	automaton::UnorderedDFTA< SymbolTypeT, StateTypeT >
	Deterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree languages. More...
class	automaton::isUnorderedDFTA_impl< T >
class	automaton::isUnorderedDFTA_impl< UnorderedDFTA< SymbolType, StateType > >
class	core::SetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet >
class	core::SetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, StateType, automaton::States >
class	core::SetConstraint< automaton::UnorderedDFTA< SymbolType, StateType >, StateType, automaton::FinalStates >
struct	core::normalize< automaton::UnorderedDFTA< SymbolType, StateType > >

Namespaces
namespace	automaton
namespace	core

Variables
template<class T >
constexpr bool	automaton::isUnorderedDFTA = isUnorderedDFTA_impl < T > { }