![]() |
Vcsn
2.2
Be Rational
|
#include <algorithm>
#include <deque>
#include <fstream>
#include <boost/heap/binomial_heap.hpp>
#include <boost/optional.hpp>
#include <vcsn/ctx/context.hh>
#include <vcsn/dyn/automaton.hh>
#include <vcsn/dyn/fwd.hh>
#include <vcsn/dyn/polynomial.hh>
#include <vcsn/labelset/word-polynomialset.hh>
#include <vcsn/algos/lightest-path.hh>
Go to the source code of this file.
Classes | |
class | vcsn::detail::enumerater< Aut > |
Compute the shortest words accepted by an automaton. More... | |
struct | vcsn::detail::enumerater< Aut >::profile_less |
Namespaces | |
vcsn | |
vcsn::detail | |
vcsn::dyn | |
vcsn::dyn::detail | |
Functions | |
template<Automaton Aut> | |
detail::enumerater< Aut > ::polynomial_t | vcsn::shortest (const Aut &aut, boost::optional< unsigned > num={}, boost::optional< unsigned > len={}) |
The approximated behavior of an automaton. More... | |
template<Automaton Aut> | |
detail::enumerater< Aut > ::polynomial_t | vcsn::enumerate (const Aut &aut, unsigned len) |
The approximated behavior of an automaton. More... | |
template<Automaton Aut, typename Num , typename Len > | |
polynomial | vcsn::dyn::detail::shortest (const automaton &aut, boost::optional< unsigned > num, boost::optional< unsigned > len) |
Bridge. More... | |