synchronizing_word.hh File Reference

#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <utility>
#include <vector>
#include <awali/sttc/algos/distance.hh>
#include <awali/sttc/core/automaton_decorator.hh>
#include <awali/sttc/core/transition_map.hh>
#include <awali/sttc/ctx/context.hh>
#include <awali/sttc/ctx/traits.hh>
#include <awali/sttc/misc/map.hh>
#include <awali/sttc/misc/pair.hh>
#include <awali/sttc/misc/raise.hh>
#include <awali/sttc/misc/zip_maps.hh>

Go to the source code of this file.

Data Structures
class	awali::sttc::internal::pair_automaton_impl< Aut >
class	awali::sttc::internal::synchronizer< Tdc >

Namespaces
	awali
	Main namespace of Awali.
	awali::sttc
	Namespace for the static layer of Awali.
	awali::sttc::internal
	Implementation details of static layer (not stable).

Typedefs
template<typename Aut >
using	awali::sttc::pair_automaton = std::shared_ptr< internal::pair_automaton_impl< Aut > >

Functions
template<typename Ctx >
mutable_automaton< Ctx >	awali::sttc::cerny (const Ctx &ctx, unsigned num_states)
	Cerny automata are automata whose synchronizing word length is always (n - 1)^2, the upper bound of the Cerny's conjecture. More...
template<typename Aut >
bool	awali::sttc::is_synchronized_by (const Aut &aut, const typename labelset_t_of< Aut >::word_t &w)
template<typename Aut >
bool	awali::sttc::is_synchronizing (const Aut &aut)
template<typename Aut >
pair_automaton< Aut >	awali::sttc::pair (const Aut &aut, bool keep_initials=false)
template<typename Aut >
labelset_t_of< Aut >::word_t	awali::sttc::synchronizing_word (const Aut &aut, const std::string &algo="greedy")