Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Namespaces | Functions
ExactSubtreeMatchingAutomaton.h File Reference
#include <tree/ranked/PrefixRankedBarTree.h>
#include <tree/ranked/PrefixRankedTree.h>
#include <tree/ranked/RankedTree.h>
#include <tree/ranked/UnorderedRankedTree.h>
#include <tree/unranked/UnrankedTree.h>
#include <automaton/PDA/InputDrivenNPDA.h>
#include <automaton/TA/NFTA.h>
#include <automaton/TA/UnorderedNFTA.h>
#include <automaton/TA/NondeterministicZAutomaton.h>
#include <alphabet/BottomOfTheStackSymbol.h>
Include dependency graph for ExactSubtreeMatchingAutomaton.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  arbology::exact::ExactSubtreeMatchingAutomaton
 

Namespaces

namespace  arbology
 
namespace  arbology::exact
 

Functions

template<class SymbolType >
unsigned arbology::exact::constructRecursive (const ext::tree< common::ranked_symbol< SymbolType > > &node, automaton::NFTA< SymbolType, unsigned > &res, unsigned &nextState)
 
template<class SymbolType >
unsigned arbology::exact::constructRecursive (const ext::tree< common::ranked_symbol< SymbolType > > &node, automaton::UnorderedNFTA< SymbolType, unsigned > &res, unsigned &nextState)
 
template<class SymbolType >
unsigned arbology::exact::constructRecursive (const ext::tree< SymbolType > &node, automaton::NondeterministicZAutomaton< SymbolType, unsigned > &res, unsigned &nextState)