22 #include <spot/twa/twagraph.hh>
75 SPOT_API twa_graph_ptr
83 SPOT_API twa_graph_ptr
98 SPOT_API twa_graph_ptr
100 bool output_assignment =
false);
104 bool output_assignment =
false);
117 SPOT_API twa_graph_ptr
129 const_twa_graph_ptr right,
130 bool verbose =
false);
Definition: automata.hh:27
void reduce_mealy_here(twa_graph_ptr &mm, bool output_assignment=false)
reduce an (in)completely specified mealy machine Based on signature inclusion or equality....
twa_graph_ptr reduce_mealy(const const_twa_graph_ptr &mm, bool output_assignment=false)
reduce an (in)completely specified mealy machine Based on signature inclusion or equality....
bool is_split_mealy(const const_twa_graph_ptr &m)
Checks whether or not the automaton is a split mealy machine.
twa_graph_ptr minimize_mealy(const const_twa_graph_ptr &mm, int premin=-1)
Minimizes a split (in)completely specified mealy machine The approach is described in.
bool is_split_mealy_specialization(const_twa_graph_ptr left, const_twa_graph_ptr right, bool verbose=false)
Test if the split mealy machine right is a specialization of the split mealy machine left.
bool is_mealy(const const_twa_graph_ptr &m)
Checks whether or not the automaton is a mealy machine.
bool is_separated_mealy(const const_twa_graph_ptr &m)
Checks whether or not the automaton is a separated mealy machine.
twa_graph_ptr split_separated_mealy(const const_twa_graph_ptr &m)
make each transition in a separated mealy machine a 2-step transition.
bool is_input_deterministic_mealy(const const_twa_graph_ptr &m)
Checks whether or not a mealy machine is input deterministic.
void split_separated_mealy_here(const twa_graph_ptr &m)
make each transition in a separated mealy machine a 2-step transition.
twa_graph_ptr unsplit_mealy(const const_twa_graph_ptr &m)
the inverse of split_separated_mealy