Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
automaton::properties::BackwardBisimulation Class Reference

#include <BackwardBisimulation.h>

Static Public Member Functions

template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > backwardBisimulation (const automaton::DFA< SymbolType, StateType > &fta)
 
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > backwardBisimulation (const automaton::NFA< SymbolType, StateType > &fta)
 
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > backwardBisimulation (const automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > &afdza)
 
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > backwardBisimulation (const automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > &afnza)
 
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > backwardBisimulation (const automaton::DFTA< SymbolType, StateType > &fta)
 
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > backwardBisimulation (const automaton::NFTA< SymbolType, StateType > &fta)
 
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > backwardBisimulation (const automaton::UnorderedDFTA< SymbolType, StateType > &fta)
 
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > backwardBisimulation (const automaton::UnorderedNFTA< SymbolType, StateType > &fta)
 

Detailed Description

Find all backwardBisimulation pairs of states of DFA. Implements table-filling algorithm, Hopcroft 2nd edition, 4.4.1

Member Function Documentation

◆ backwardBisimulation() [1/8]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::BackwardBisimulation::backwardBisimulation ( const automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > &  afdza)
static
Here is the call graph for this function:

◆ backwardBisimulation() [2/8]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::BackwardBisimulation::backwardBisimulation ( const automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > &  afnza)
static
Here is the call graph for this function:

◆ backwardBisimulation() [3/8]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::BackwardBisimulation::backwardBisimulation ( const automaton::DFA< SymbolType, StateType > &  fta)
static

Computes a relation on states of the DFA satisfying the backward bisimulation definition.

Parameters
ftathe examined automaton
Returns
set of pairs of states of the fta that are the backward bisimulation.
Here is the call graph for this function:
Here is the caller graph for this function:

◆ backwardBisimulation() [4/8]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::BackwardBisimulation::backwardBisimulation ( const automaton::DFTA< SymbolType, StateType > &  fta)
static

Computes a relation on states of the DFTA satisfying the backward bisimulation definition.

Parameters
ftathe examined automaton
Returns
set of pairs of states of the fta that are the backward bisimulation.
Here is the call graph for this function:

◆ backwardBisimulation() [5/8]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::BackwardBisimulation::backwardBisimulation ( const automaton::NFA< SymbolType, StateType > &  fta)
static

Computes a relation on states of the NFA satisfying the backward bisimulation definition.

Parameters
ftathe examined automaton
Returns
set of pairs of states of the fta that are the backward bisimulation.
Here is the call graph for this function:

◆ backwardBisimulation() [6/8]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::BackwardBisimulation::backwardBisimulation ( const automaton::NFTA< SymbolType, StateType > &  fta)
static

Computes a relation on states of the NFTA satisfying the backward bisimulation definition.

Parameters
ftathe examined automaton
Returns
set of pairs of states of the fta that are the backward bisimulation.
Here is the call graph for this function:

◆ backwardBisimulation() [7/8]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::BackwardBisimulation::backwardBisimulation ( const automaton::UnorderedDFTA< SymbolType, StateType > &  fta)
static

Computes a relation on states of the DFTA satisfying the backward bisimulation definition.

Parameters
ftathe examined automaton
Returns
set of pairs of states of the fta that are the backward bisimulation.
Here is the call graph for this function:

◆ backwardBisimulation() [8/8]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::BackwardBisimulation::backwardBisimulation ( const automaton::UnorderedNFTA< SymbolType, StateType > &  fta)
static

Computes a relation on states of the NFTA satisfying the backward bisimulation definition.

Parameters
ftathe examined automaton
Returns
set of pairs of states of the fta that are the backward bisimulation.
Here is the call graph for this function:

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