Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages. More...

#include <DFTA.h>

Inheritance diagram for automaton::DFTA< SymbolTypeT, StateTypeT >:

Collaboration diagram for automaton::DFTA< SymbolTypeT, StateTypeT >:

Public Types
typedef SymbolTypeT	SymbolType

typedef StateTypeT	StateType

Public Member Functions
	DFTA ()
	Creates a new instance of the automaton. More...

	DFTA (ext::set< StateType > states, ext::set< common::ranked_symbol< SymbolType > > inputAlphabet, ext::set< StateType > finalStates)
	Creates a new instance of the automaton with a concrete set of states, input alphabet, and a set of final states. More...

const ext::set< StateType > &	getStates () const &

ext::set< StateType > &&	getStates () &&

bool	addState (StateType state)

void	setStates (ext::set< StateType > states)

void	removeState (const StateType &state)

const ext::set< StateType > &	getFinalStates () const &

ext::set< StateType > &&	getFinalStates () &&

bool	addFinalState (StateType state)

void	setFinalStates (ext::set< StateType > states)

void	removeFinalState (const StateType &state)

const ext::set< common::ranked_symbol< SymbolType > > &	getInputAlphabet () const &

ext::set< common::ranked_symbol< SymbolType > > &&	getInputAlphabet () &&

bool	addInputSymbol (common::ranked_symbol< SymbolType > symbol)

void	addInputSymbols (ext::set< common::ranked_symbol< SymbolType > > symbols)

void	setInputAlphabet (ext::set< common::ranked_symbol< SymbolType > > symbols)

void	removeInputSymbol (const common::ranked_symbol< SymbolType > &symbol)

bool	addTransition (common::ranked_symbol< SymbolType > symbol, ext::vector< StateType > prevStates, StateType next)
	Add a transition to the automaton. More...

bool	removeTransition (const common::ranked_symbol< SymbolType > &symbol, const ext::vector< StateType > &states, const StateType &next)
	Removes a transition from the automaton. More...

const ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType > &	getTransitions () const &

ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType > &&	getTransitions () &&

ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType >	getTransitionsToState (const StateType &q) const

ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType >	getTransitionsFromState (const StateType &q) const

auto	operator<=> (const DFTA &other) const

bool	operator== (const DFTA &other) const

Public Member Functions inherited from core::Components< DFTA< DefaultSymbolType, DefaultStateType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > >
void	accessComponent ()

Friends
ext::ostream &	operator<< (ext::ostream &out, const DFTA &instance)

Additional Inherited Members
Static Public Member Functions inherited from core::Components< DFTA< DefaultSymbolType, DefaultStateType >, ext::set< common::ranked_symbol< DefaultSymbolType > >, component::Set, InputAlphabet, ext::set< DefaultStateType >, component::Set, std::tuple< States, FinalStates > >
static void	registerComponent ()

static void	unregisterComponent ()

Detailed Description

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>
class automaton::DFTA< SymbolTypeT, StateTypeT >

Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages.

Definition is classical definition of finite automata. A = (Q, \Sigma, \delta, F), Q (States) = nonempty finite set of states, \Sigma (TerminalAlphabet) = finite set of terminal ranked symbols - having this empty won't let automaton do much though,

the alphabet may be partitioned based on the arity of symbols into \Sigma_n, where n is the arity. \delta = transition function of the form (Q^n \times \Sigma_n) \mapsto Q, F (FinalStates) = set of final states

Elements of the \delta mapping must meet following criteria. The size of the state list must equal the rank of the ranked symbol.

Note that target state of a transition is required. This class is used to store minimal, total, ... variants of deterministic finite tree automata.

Elements of the \delta mapping must meet following criteria. The size of the state list must equal the rank of the ranked symbol.

Template Parameters

SymbolTypeT	used for the symbol part of the ranked symbol
StateTypeT	used to the states, and the initial state of the automaton.

Member Typedef Documentation

◆ StateType

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

typedef StateTypeT automaton::DFTA< SymbolTypeT, StateTypeT >::StateType

◆ SymbolType

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

typedef SymbolTypeT automaton::DFTA< SymbolTypeT, StateTypeT >::SymbolType

Constructor & Destructor Documentation

◆ DFTA() [1/2]

template<class SymbolType , class StateType >

automaton::DFTA< SymbolType, StateType >::DFTA

explicit

Creates a new instance of the automaton.

◆ DFTA() [2/2]

template<class SymbolType , class StateType >

automaton::DFTA< SymbolType, StateType >::DFTA	(	ext::set< StateType >	states,
		ext::set< common::ranked_symbol< SymbolType > >	inputAlphabet,
		ext::set< StateType >	finalStates
	)

explicit

Creates a new instance of the automaton with a concrete set of states, input alphabet, and a set of final states.

Parameters

states	the initial set of states of the automaton
inputAlphabet	the initial input alphabet
finalStates	the initial set of final states of the automaton

Member Function Documentation

◆ addFinalState()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

bool automaton::DFTA< SymbolTypeT, StateTypeT >::addFinalState ( StateType state )

inline

Adder of a final state.

Parameters

state the new state to be added to a set of final states

Returns: true if the state was indeed added

Here is the caller graph for this function:

◆ addInputSymbol()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

bool automaton::DFTA< SymbolTypeT, StateTypeT >::addInputSymbol ( common::ranked_symbol< SymbolType > symbol )

inline

Adder of a input symbol.

Parameters

symbol the new symbol to be added to an input alphabet

Returns: true if the symbol was indeed added

Here is the caller graph for this function:

◆ addInputSymbols()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

void automaton::DFTA< SymbolTypeT, StateTypeT >::addInputSymbols ( ext::set< common::ranked_symbol< SymbolType > > symbols )

inline

Adder of input symbols.

Parameters

symbols new symbols to be added to an input alphabet

◆ addState()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

bool automaton::DFTA< SymbolTypeT, StateTypeT >::addState ( StateType state )

inline

Adder of a state.

Parameters

state the new state to be added to a set of states

Returns: true if the state was indeed added

Here is the caller graph for this function:

◆ addTransition()

template<class SymbolType , class StateType >

bool automaton::DFTA< SymbolType, StateType >::addTransition	(	common::ranked_symbol< SymbolType >	symbol,
		ext::vector< StateType >	prevStates,
		StateType	next
	)

Add a transition to the automaton.

The transition is in a form (Q^n \times \Sigma_n) \mapsto Q,

Parameters

children	the source states in Q^n
current	the input symbol in \Sigma_n
next	the target state in Q

Exceptions

AutomatonException when transition contains state or symbol not present in the automaton components

Returns: true if the transition was indeed added

Here is the call graph for this function:

Here is the caller graph for this function:

◆ getFinalStates() [1/2]

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

ext::set< StateType > && automaton::DFTA< SymbolTypeT, StateTypeT >::getFinalStates ( ) &&

inline

Getter of final states.

Returns: the final states of the automaton

Here is the call graph for this function:

◆ getFinalStates() [2/2]

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

const ext::set< StateType > & automaton::DFTA< SymbolTypeT, StateTypeT >::getFinalStates ( ) const &

inline

Getter of final states.

Returns: the final states of the automaton

Here is the caller graph for this function:

◆ getInputAlphabet() [1/2]

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

ext::set< common::ranked_symbol< SymbolType > > && automaton::DFTA< SymbolTypeT, StateTypeT >::getInputAlphabet ( ) &&

inline

Getter of the input alphabet.

Returns: the input alphabet of the automaton

Here is the call graph for this function:

◆ getInputAlphabet() [2/2]

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

const ext::set< common::ranked_symbol< SymbolType > > & automaton::DFTA< SymbolTypeT, StateTypeT >::getInputAlphabet ( ) const &

inline

Getter of the input alphabet.

Returns: the input alphabet of the automaton

Here is the caller graph for this function:

◆ getStates() [1/2]

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

ext::set< StateType > && automaton::DFTA< SymbolTypeT, StateTypeT >::getStates ( ) &&

inline

Getter of states.

Returns: the states of the automaton

Here is the call graph for this function:

◆ getStates() [2/2]

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

const ext::set< StateType > & automaton::DFTA< SymbolTypeT, StateTypeT >::getStates ( ) const &

inline

Getter of states.

Returns: the states of the automaton

Here is the caller graph for this function:

◆ getTransitions() [1/2]

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType > && automaton::DFTA< SymbolTypeT, StateTypeT >::getTransitions ( ) &&

inline

Get the transition function of the automaton in its natural form.

Returns: transition function of the automaton

◆ getTransitions() [2/2]

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

const ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType > & automaton::DFTA< SymbolTypeT, StateTypeT >::getTransitions ( ) const &

inline

Get the transition function of the automaton in its natural form.

Returns: transition function of the automaton

Here is the caller graph for this function:

◆ getTransitionsFromState()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType > automaton::DFTA< SymbolTypeT, StateTypeT >::getTransitionsFromState ( const StateType & q ) const

inline

Returns: transitions from state q

Here is the call graph for this function:

◆ getTransitionsToState()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType > automaton::DFTA< SymbolTypeT, StateTypeT >::getTransitionsToState ( const StateType & q ) const

inline

Returns: transitions to state q

Here is the call graph for this function:

◆ operator<=>()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

auto automaton::DFTA< SymbolTypeT, StateTypeT >::operator<=> ( const DFTA< SymbolTypeT, StateTypeT > & other ) const

inline

The three way comparison implementation

Parameters

other the other instance

Returns: the ordering between this object and the other.

Here is the call graph for this function:

◆ operator==()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

bool automaton::DFTA< SymbolTypeT, StateTypeT >::operator== ( const DFTA< SymbolTypeT, StateTypeT > & other ) const

inline

The equality comparison implementation.

Parameters

other the other object to compare with.

Returns: true if this and other objects are equal, false othervise

Here is the call graph for this function:

◆ removeFinalState()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

void automaton::DFTA< SymbolTypeT, StateTypeT >::removeFinalState ( const StateType & state )

inline

Remover of a final state.

Parameters

state a state to be removed from a set of final states

Returns: true if the state was indeed removed

◆ removeInputSymbol()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

void automaton::DFTA< SymbolTypeT, StateTypeT >::removeInputSymbol ( const common::ranked_symbol< SymbolType > & symbol )

inline

Remover of an input symbol.

Parameters

symbol a symbol to be removed from an input alphabet

Returns: true if the symbol was indeed removed

◆ removeState()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

void automaton::DFTA< SymbolTypeT, StateTypeT >::removeState ( const StateType & state )

inline

Remover of a state.

Parameters

state a state to be removed from a set of states

Returns: true if the state was indeed removed

◆ removeTransition()

template<class SymbolType , class StateType >

bool automaton::DFTA< SymbolType, StateType >::removeTransition	(	const common::ranked_symbol< SymbolType > &	symbol,
		const ext::vector< StateType > &	states,
		const StateType &	next
	)

Removes a transition from the automaton.

The transition is in a form (Q^n \times \Sigma_n) \mapsto Q,

Parameters

children	the source states in Q^n
current	the input symbol in \Sigma_n
next	the target state in Q

Returns: true if the transition was indeed removed

Here is the call graph for this function:

◆ setFinalStates()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

void automaton::DFTA< SymbolTypeT, StateTypeT >::setFinalStates ( ext::set< StateType > states )

inline

Setter of final states.

Parameters

states completely new set of final states

◆ setInputAlphabet()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

void automaton::DFTA< SymbolTypeT, StateTypeT >::setInputAlphabet ( ext::set< common::ranked_symbol< SymbolType > > symbols )

inline

Setter of input alphabet.

Parameters

symbols completely new input alphabet

◆ setStates()

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

void automaton::DFTA< SymbolTypeT, StateTypeT >::setStates ( ext::set< StateType > states )

inline

Setter of states.

Parameters

states completely new set of states

Friends And Related Function Documentation

◆ operator<<

template<class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType>

ext::ostream & operator<<	(	ext::ostream &	out,
		const DFTA< SymbolTypeT, StateTypeT > &	instance
	)

friend

Print this object as raw representation to ostream.

Parameters

out	ostream where to print
instance	object to print

Returns: modified output stream

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

alib2data/src/automaton/TA/DFTA.h

Public Types

Public Member Functions

Friends

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ StateType

◆ SymbolType

Constructor & Destructor Documentation

◆ DFTA() [1/2]

◆ DFTA() [2/2]

Member Function Documentation

◆ addFinalState()

◆ addInputSymbol()

◆ addInputSymbols()

◆ addState()

◆ addTransition()

◆ getFinalStates() [1/2]

◆ getFinalStates() [2/2]

◆ getInputAlphabet() [1/2]

◆ getInputAlphabet() [2/2]

◆ getStates() [1/2]

◆ getStates() [2/2]

◆ getTransitions() [1/2]

◆ getTransitions() [2/2]

◆ getTransitionsFromState()

◆ getTransitionsToState()

◆ operator<=>()

◆ operator==()

◆ removeFinalState()

◆ removeInputSymbol()

◆ removeState()

◆ removeTransition()

◆ setFinalStates()

◆ setInputAlphabet()

◆ setStates()

Friends And Related Function Documentation

◆ operator<<