22 #include <spot/twa/twagraph.hh> 85 is_complete(
const const_twa_graph_ptr& aut);
92 is_semi_deterministic(
const const_twa_graph_ptr& aut);
Definition: automata.hh:26
bool is_deterministic(const const_twa_graph_ptr &aut)
Return true iff aut is deterministic.
void highlight_nondet_edges(twa_graph_ptr &aut, unsigned color)
Highlight nondeterministic edges.
unsigned count_nondet_states(const const_twa_graph_ptr &aut)
Count the number of states with non-deterministic branching in aut.
bool is_universal(const const_twa_graph_ptr &aut)
Return true iff aut is universal.
void highlight_nondet_states(twa_graph_ptr &aut, unsigned color)
Highlight nondeterministic states.