arbology::exact::ExactSubtreeMatchingAutomaton Class Reference

#include <ExactSubtreeMatchingAutomaton.h>

Static Public Member Functions
template<class SymbolType >
static automaton::InputDrivenNPDA< common::ranked_symbol< SymbolType >, char, unsigned >	construct (const tree::PrefixRankedTree< SymbolType > &pattern)
template<class SymbolType >
static automaton::InputDrivenNPDA< common::ranked_symbol< SymbolType >, char, unsigned >	construct (const tree::PrefixRankedBarTree< SymbolType > &pattern)
template<class SymbolType >
static automaton::NFTA< SymbolType, unsigned >	construct (const tree::RankedTree< SymbolType > &pattern)
template<class SymbolType >
static automaton::UnorderedNFTA< SymbolType, unsigned >	construct (const tree::UnorderedRankedTree< SymbolType > &pattern)
template<class SymbolType >
static automaton::NondeterministicZAutomaton< SymbolType, unsigned >	construct (const tree::UnrankedTree< SymbolType > &pattern)

Member Function Documentation

construct() [1/5]

template<class SymbolType >

automaton::InputDrivenNPDA< common::ranked_symbol< SymbolType >, char, unsigned > arbology::exact::ExactSubtreeMatchingAutomaton::construct ( const tree::PrefixRankedBarTree< SymbolType > &  pattern )

static

Here is the call graph for this function:

construct() [2/5]

template<class SymbolType >

automaton::InputDrivenNPDA< common::ranked_symbol< SymbolType >, char, unsigned > arbology::exact::ExactSubtreeMatchingAutomaton::construct ( const tree::PrefixRankedTree< SymbolType > &  pattern )

static

Performs conversion.

Returns

left regular grammar equivalent to source automaton.

Here is the call graph for this function:

Here is the caller graph for this function:

construct() [3/5]

template<class SymbolType >

automaton::NFTA< SymbolType, unsigned > arbology::exact::ExactSubtreeMatchingAutomaton::construct ( const tree::RankedTree< SymbolType > &  pattern )

static

Here is the call graph for this function:

construct() [4/5]

template<class SymbolType >

automaton::UnorderedNFTA< SymbolType, unsigned > arbology::exact::ExactSubtreeMatchingAutomaton::construct ( const tree::UnorderedRankedTree< SymbolType > &  pattern )

static

Here is the call graph for this function:

construct() [5/5]

template<class SymbolType >

automaton::NondeterministicZAutomaton< SymbolType, unsigned > arbology::exact::ExactSubtreeMatchingAutomaton::construct ( const tree::UnrankedTree< SymbolType > &  pattern )

static

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• alib2algo/src/arbology/exact/ExactSubtreeMatchingAutomaton.h