#include<sttc/algos/accessible.hh>
Namespace: awali::sttc
accessible_states List of accessible states
coaccessible_states List of coaccessible states
useful_states List of useful states
    template <typename Aut>
    std::set<state_t_of<Aut>>
    accessible_states(const Aut& aut, bool include_pre_post=false);

    template <typename Aut>
    std::set<state_t_of<Aut>>
    coaccessible_states(const Aut& aut, bool include_pre_post=false);

    template <typename Aut>
    std::set<state_t_of<Aut>>
    useful_states(const Aut& aut, bool include_pre_post=false);
Computes the list of accessible (resp. coaccessible, useful) states in aut.
    template <typename Aut>
    size_t
    num_accessible_states(const Aut& aut);

    template <typename Aut>
    size_t
    num_coaccessible_states(const Aut& aut);

    template <typename Aut>
    size_t
    num_useful_states(const Aut& aut);
Computes the number of accessible (resp. coaccessible, useful) states (not counting pre-initial and post-final state).
    template <typename Aut>
    void
    accessible_here(const Aut& aut);

    template <typename Aut>
    void
    coaccessible_here(const Aut& aut);

    template <typename Aut>
    void
    trim_here(const Aut& aut);

Remove every every state in aut which is not accessible (resp. coaccessible, useful).


    template <typename Aut>
    Aut
    accessible(const Aut& aut, bool keep_history=true);

    template <typename Aut>
    Aut
    coaccessible(const Aut& aut, bool keep_history=true);

    template <typename Aut>
    Aut
    trim(const Aut& aut, bool keep_history=true);

    template <typename Aut>
    bool
    is_accessible(const Aut& aut);

    template <typename Aut>
    bool
    is_coaccessible(const Aut& aut);

    template <typename Aut>
    bool
    is_trim(const Aut& aut);