22 #include <spot/twa/twagraph.hh>
48 const twa_graph_ptr& aut_;
49 std::map<unsigned, int> state_to_var;
50 std::map<int, unsigned> var_to_state;
55 bdd operator()(
unsigned st);
56 void new_dests(
unsigned st, bdd out)
const;
70 unsigned states_and(
const twa_graph_ptr& aut, I begin, I end)
73 throw std::runtime_error
74 (
"state_and() expects an non-empty list of states");
76 bdd combination = bddtrue;
78 combination &= combiner(*begin++);
79 unsigned new_s = aut->new_state();
80 combiner.new_dests(new_s, combination);
86 unsigned states_and(
const twa_graph_ptr& aut,
87 const std::initializer_list<T>& il)
89 return states_and(aut, il.begin(), il.end());
101 twa_graph_ptr remove_alternation(
const const_twa_graph_ptr& aut,
102 bool named_states =
false);
Helper class combine outgoing edges in alternating automata.
Definition: alternation.hh:45