![]() |
Vcsn
2.0
Be Rational
|
#include <algorithm>#include <map>#include <stack>#include <unordered_map>#include <unordered_set>#include <vcsn/algos/accessible.hh>#include <vcsn/dyn/automaton.hh>#include <vcsn/dyn/fwd.hh>#include <vcsn/misc/hash.hh>#include <vcsn/misc/map.hh>#include <vcsn/misc/vector.hh>Go to the source code of this file.
Classes | |
| class | vcsn::are_isomorphicer< Aut1, Aut2 > |
| struct | vcsn::are_isomorphicer< Aut1, Aut2 >::full_response |
| A datum specifying if two given automata are isomorphic, and why if they are not. More... | |
Namespaces | |
| vcsn | |
| vcsn::dyn | |
| FIXME: duplicate code with determinize. | |
| vcsn::dyn::detail | |
Macros | |
| #define | HASH_TRANSITIONS(expression, endpoint_getter) |
Functions | |
| template<typename Aut1 , typename Aut2 > | |
| bool | vcsn::are_isomorphic (const Aut1 &a1, const Aut2 &a2) |
| template<typename Aut1 , typename Aut2 > | |
| bool | vcsn::dyn::detail::are_isomorphic (const automaton &aut1, const automaton &aut2) |
| Bridge. More... | |
| vcsn::dyn::detail::REGISTER_DECLARE (are_isomorphic,(const automaton &, const automaton &) -> bool) | |
| #define HASH_TRANSITIONS | ( | expression, | |
| endpoint_getter | |||
| ) |
Referenced by vcsn::are_isomorphicer< Aut1, Aut2 >::state_to_class().