Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <ostream>
#include <alib/map>
#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 <rte/formal/FormalRTEElements.h>
#include <rte/formal/FormalRTEStructure.h>
#include "DFTA.h"
#include "NFTA.h"
Go to the source code of this file.
Data Structures | |
class | automaton::ExtendedNFTA< SymbolType, StateType > |
Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages. More... | |
class | core::SetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet > |
class | core::SetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, StateType, automaton::States > |
class | core::SetConstraint< automaton::ExtendedNFTA< SymbolType, StateType >, StateType, automaton::FinalStates > |
struct | core::normalize< automaton::ExtendedNFTA< SymbolType, StateType > > |
Namespaces | |
namespace | automaton |
namespace | core |