21 #include <spot/twa/twagraph.hh>
44 int target_state_number,
45 bool state_based =
false);
56 bool state_based =
false,
67 bool state_based =
false,
83 bool state_based =
false,
102 bool state_based =
false,
twa_graph_ptr dtba_sat_minimize(const const_twa_graph_ptr &a, bool state_based=false, int max_states=-1)
Attempt to minimize a deterministic TBA with a SAT solver.
twa_graph_ptr dtba_sat_synthetize(const const_twa_graph_ptr &a, int target_state_number, bool state_based=false)
Attempt to synthesize an equivalent deterministic TBA with a SAT solver.
std::shared_ptr< twa_graph > twa_graph_ptr
Shared pointer to a mutable twa_graph.
Definition: fwd.hh:44
std::shared_ptr< const twa_graph > const_twa_graph_ptr
Shared pointer to a const twa_graph.
Definition: fwd.hh:38
Definition: automata.hh:26
twa_graph_ptr dtba_sat_minimize_assume(const const_twa_graph_ptr &a, bool state_based=false, int max_states=-1, int param=6)
Attempt to minimize a deterministic TBA incrementally with a SAT solver.
twa_graph_ptr dtba_sat_minimize_incr(const const_twa_graph_ptr &a, bool state_based=false, int max_states=-1, int param=2)
Attempt to minimize a det. TBA with a SAT solver.
twa_graph_ptr dtba_sat_minimize_dichotomy(const const_twa_graph_ptr &a, bool state_based=false, bool langmap=false, int max_states=-1)
Attempt to minimize a deterministic TBA with a SAT solver.