Implementation of automaton run over its input. More...

#include <Run.h>

Static Public Member Functions
template<class SymbolType , class StateType >
static ext::tuple< bool, StateType, ext::set< unsigned > >	calculateState (const automaton::DFA< SymbolType, StateType > &automaton, const string::LinearString< SymbolType > &string)

template<class SymbolType , class StateType >
static ext::tuple< bool, ext::set< StateType >, ext::set< unsigned > >	calculateStates (const automaton::NFA< SymbolType, StateType > &automaton, const string::LinearString< SymbolType > &string)

template<class SymbolType , class StateType >
static ext::tuple< bool, ext::set< StateType >, ext::set< unsigned > >	calculateStates (const automaton::EpsilonNFA< SymbolType, StateType > &automaton, const string::LinearString< SymbolType > &string)

template<class SymbolType , class StateType >
static ext::tuple< bool, StateType, ext::set< unsigned > >	calculateState (const automaton::DFTA< SymbolType, StateType > &automaton, const tree::RankedTree< SymbolType > &tree)

template<class SymbolType , class StateType >
static ext::tuple< bool, StateType, ext::set< unsigned > >	calculateState (const automaton::UnorderedDFTA< SymbolType, StateType > &automaton, const tree::UnorderedRankedTree< SymbolType > &tree)

template<class SymbolType , class StateType >
static ext::tuple< bool, StateType, ext::set< unsigned > >	calculateState (const automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > &automaton, const tree::UnrankedTree< SymbolType > &tree)

template<class SymbolType , class StateType >
static ext::tuple< bool, ext::set< StateType >, ext::set< unsigned > >	calculateStates (const automaton::NFTA< SymbolType, StateType > &automaton, const tree::RankedTree< SymbolType > &tree)

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >
static ext::tuple< bool, StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > >	calculateState (const automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &automaton, const string::LinearString< InputSymbolType > &string)

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >
static ext::tuple< bool, StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > >	calculateState (const automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &automaton, const string::LinearString< InputSymbolType > &string)

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >
static ext::tuple< bool, StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > >	calculateState (const automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &automaton, const string::LinearString< InputSymbolType > &string)

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >
static ext::tuple< bool, StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > >	calculateState (const automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &automaton, const string::LinearString< InputSymbolType > &string)

template<class InputSymbolType , class OutputSymbolType , class PushdownStoreSymbolType , class StateType >
static ext::set< ext::tuple< StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType >, ext::deque< OutputSymbolType > > >	calculateStates (const automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > &automaton, const string::LinearString< InputSymbolType > &string)

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >
static ext::set< ext::tuple< StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > > >	calculateStates (const automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &automaton, const string::LinearString< InputSymbolType > &string)

Detailed Description

Implementation of automaton run over its input.

Member Function Documentation

◆ calculateState() [1/8]

template<class SymbolType , class StateType >

ext::tuple< bool, StateType, ext::set< unsigned > > automaton::run::Run::calculateState	(	const automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > &	automaton,
		const tree::UnrankedTree< SymbolType > &	tree
	)

static

Here is the call graph for this function:

◆ calculateState() [2/8]

template<class SymbolType , class StateType >

ext::tuple< bool, StateType, ext::set< unsigned > > automaton::run::Run::calculateState	(	const automaton::DFA< SymbolType, StateType > &	automaton,
		const string::LinearString< SymbolType > &	string
	)

static

General automaton run implementation.

Template Parameters

SymbolType	type of symbols of the string and terminal symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise state where the run stopped set of indexes to the string where the automaton passed a final state

Here is the call graph for this function:

◆ calculateState() [3/8]

template<class SymbolType , class StateType >

ext::tuple< bool, StateType, ext::set< unsigned > > automaton::run::Run::calculateState	(	const automaton::DFTA< SymbolType, StateType > &	automaton,
		const tree::RankedTree< SymbolType > &	tree
	)

static

\override

Template Parameters

SymbolType	type of symbols of tree nodes and terminal symbols of the runned automaton
RankType	type of ranks of tree nodes and terminal symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise state where the run stopped set of indexes to the tree where the automaton passed a final state (as in the postorder traversal)

Here is the call graph for this function:

◆ calculateState() [4/8]

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >

ext::tuple< bool, StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > > automaton::run::Run::calculateState	(	const automaton::DPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &	automaton,
		const string::LinearString< InputSymbolType > &	string
	)

static

\override

Template Parameters

InputSymbolType	type of symbols of the string and terminal symbols of the runned automaton
PushdownStoreSymbolType	type of pushdown store symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise state where the run stopped set of indexes to the tree where the automaton passed a final state deque representing the final content of the pushdown store

Here is the call graph for this function:

◆ calculateState() [5/8]

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >

ext::tuple< bool, StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > > automaton::run::Run::calculateState	(	const automaton::InputDrivenDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &	automaton,
		const string::LinearString< InputSymbolType > &	string
	)

static

\override

Template Parameters

InputSymbolType	type of symbols of the string and terminal symbols of the runned automaton
PushdownStoreSymbolType	type of pushdown store symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise state where the run stopped set of indexes to the tree where the automaton passed a final state deque representing the final content of the pushdown store

Here is the call graph for this function:

◆ calculateState() [6/8]

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >

ext::tuple< bool, StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > > automaton::run::Run::calculateState	(	const automaton::RealTimeHeightDeterministicDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &	automaton,
		const string::LinearString< InputSymbolType > &	string
	)

static

\override

Template Parameters

InputSymbolType	type of symbols of the string and terminal symbols of the runned automaton
PushdownStoreSymbolType	type of pushdown store symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise state where the run stopped set of indexes to the tree where the automaton passed a final state deque representing the final content of the pushdown store

Here is the call graph for this function:

◆ calculateState() [7/8]

template<class SymbolType , class StateType >

ext::tuple< bool, StateType, ext::set< unsigned > > automaton::run::Run::calculateState	(	const automaton::UnorderedDFTA< SymbolType, StateType > &	automaton,
		const tree::UnorderedRankedTree< SymbolType > &	tree
	)

static

\override

Template Parameters

SymbolType	type of symbols of tree nodes and terminal symbols of the runned automaton
RankType	type of ranks of tree nodes and terminal symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise state where the run stopped set of indexes to the tree where the automaton passed a final state (as in the postorder traversal)

Here is the call graph for this function:

◆ calculateState() [8/8]

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >

ext::tuple< bool, StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > > automaton::run::Run::calculateState	(	const automaton::VisiblyPushdownDPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &	automaton,
		const string::LinearString< InputSymbolType > &	string
	)

static

\override

Template Parameters

InputSymbolType	type of symbols of the string and terminal symbols of the runned automaton
PushdownStoreSymbolType	type of pushdown store symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise state where the run stopped set of indexes to the tree where the automaton passed a final deque representing the final content of the pushdown store

Here is the call graph for this function:

◆ calculateStates() [1/5]

template<class SymbolType , class StateType >

ext::tuple< bool, ext::set< StateType >, ext::set< unsigned > > automaton::run::Run::calculateStates	(	const automaton::EpsilonNFA< SymbolType, StateType > &	automaton,
		const string::LinearString< SymbolType > &	string
	)

static

\override

Template Parameters

SymbolType	type of symbols of the string and terminal symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise set of states where the run stopped set of indexes to the string where the automaton passed a final state

Here is the call graph for this function:

◆ calculateStates() [2/5]

template<class SymbolType , class StateType >

ext::tuple< bool, ext::set< StateType >, ext::set< unsigned > > automaton::run::Run::calculateStates	(	const automaton::NFA< SymbolType, StateType > &	automaton,
		const string::LinearString< SymbolType > &	string
	)

static

\override

Template Parameters

SymbolType	type of symbols of the string and terminal symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise set of states where the run stopped set of indexes to the string where the automaton passed a final state

Here is the call graph for this function:

◆ calculateStates() [3/5]

template<class SymbolType , class StateType >

ext::tuple< bool, ext::set< StateType >, ext::set< unsigned > > automaton::run::Run::calculateStates	(	const automaton::NFTA< SymbolType, StateType > &	automaton,
		const tree::RankedTree< SymbolType > &	tree
	)

static

\override

Template Parameters

SymbolType	type of symbols of tree nodes and terminal symbols of the runned automaton
RankType	type of ranks of tree nodes and terminal symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise set of states where the run stopped set of indexes to the tree where the automaton passed a final state (as in the postorder traversal)

Here is the call graph for this function:

◆ calculateStates() [4/5]

template<class InputSymbolType , class PushdownStoreSymbolType , class StateType >

ext::set< ext::tuple< StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType > > > automaton::run::Run::calculateStates	(	const automaton::NPDA< InputSymbolType, PushdownStoreSymbolType, StateType > &	automaton,
		const string::LinearString< InputSymbolType > &	string
	)

static

\override

Template Parameters

InputSymbolType	type of input symbols of the string and terminal symbols of the runned automaton
PushdownStoreSymbolType	type of pushdown store symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise set of states where the run stopped set of symbol vectors representing the translations

Here is the call graph for this function:

◆ calculateStates() [5/5]

template<class InputSymbolType , class OutputSymbolType , class PushdownStoreSymbolType , class StateType >

ext::set< ext::tuple< StateType, ext::set< unsigned >, ext::deque< PushdownStoreSymbolType >, ext::deque< OutputSymbolType > > > automaton::run::Run::calculateStates	(	const automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > &	automaton,
		const string::LinearString< InputSymbolType > &	string
	)

static

\override

Template Parameters

InputSymbolType	type of input symbols of the string and terminal symbols of the runned automaton
OutputSymbolType	type of output symbols of the runned automaton
PushdownStoreSymbolType	type of pushdown store symbols of the runned automaton
StateType	type of states of the runned automaton

Parameters

automaton	the runned automaton
string	the input of the automaton

Returns: tuple of true if the automaton does not fail to find transitions, false otherwise set of states where the run stopped set of symbol vectors representing the translations

Here is the call graph for this function:

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

alib2algo/src/automaton/run/Run.h

Static Public Member Functions

Detailed Description

Member Function Documentation

◆ calculateState() [1/8]

◆ calculateState() [2/8]

◆ calculateState() [3/8]

◆ calculateState() [4/8]

◆ calculateState() [5/8]

◆ calculateState() [6/8]

◆ calculateState() [7/8]

◆ calculateState() [8/8]

◆ calculateStates() [1/5]

◆ calculateStates() [2/5]

◆ calculateStates() [3/5]

◆ calculateStates() [4/5]

◆ calculateStates() [5/5]