21 #include <spot/misc/common.hh>
22 #include <spot/twa/fwd.hh>
23 #include <spot/twa/bdddict.hh>
twa_graph_ptr aut_pattern(aut_pattern_id pattern, int n, int m, spot::bdd_dict_ptr dict=make_bdd_dict())
generate an automaton from a two-parameter pattern
const char * aut_pattern_name(aut_pattern_id pattern)
convert an aut_pattern_it value into a name
aut_pattern_id
Identifiers for automaton patterns.
Definition: automata.hh:35
int aut_pattern_max(aut_pattern_id pattern)
return the maximum useful value for a pattern
int aut_pattern_argc(aut_pattern_id pattern)
return the number of arguments taken by a pattern
@ AUT_CYCLE_ONEHOT_NBA
cycles of n letters repeated n times
Definition: automata.hh:119
@ AUT_CYCLE_LOG_NBA
cycles of n letters repeated n times
Definition: automata.hh:108
@ AUT_CYCLIST_PROOF_DBA
A DBA with (n+2) states derived from a Cyclic test case.
Definition: automata.hh:98
@ AUT_KS_NCA
A family of co-Büchi automata.
Definition: automata.hh:45
@ AUT_CYCLIST_TRACE_NBA
An NBA with (n+2) states derived from a Cyclic test case.
Definition: automata.hh:89
@ AUT_M_NBA
An NBA with (n+1) states whose complement needs ≥n! states.
Definition: automata.hh:80
@ AUT_EL_EMPTY
One-state automaton used to benchmark emptiness checks.
Definition: automata.hh:134
@ AUT_L_NBA
Hard-to-complement non-deterministic Büchi automata.
Definition: automata.hh:57
@ AUT_L_DSA
DSA hard to convert to DRA.
Definition: automata.hh:69
bdd_dict_ptr make_bdd_dict()
Create a new, empty bdd_dict wrapped in a shared pointer.
Definition: bdddict.hh:308
std::shared_ptr< bdd_dict > bdd_dict_ptr
Shared pointer to a bdd_dict.
Definition: bdddict.hh:304
std::shared_ptr< twa_graph > twa_graph_ptr
Shared pointer to a mutable twa_graph.
Definition: fwd.hh:44
Definition: automata.hh:26