21 #include <spot/twaalgos/emptiness.hh>
42 dict_->unregister_all_my_variables(
this);
100 return as_automaton()->intersects(aut);
127 return std::make_shared<twa_word>(dict);
134 return std::make_shared<twa_word>(run);
std::shared_ptr< twa_run > twa_run_ptr
Shared pointer to a twa_run.
Definition: twa.hh:38
twa_word_ptr parse_word(const std::string &word, const bdd_dict_ptr &dict)
Parse a twa_word.
std::shared_ptr< twa_word > twa_word_ptr
Shared pointer to a mutable twa_word.
Definition: fwd.hh:60
twa_word_ptr make_twa_word(const bdd_dict_ptr &dict)
Create an empty twa_word.
Definition: word.hh:125
std::shared_ptr< bdd_dict > bdd_dict_ptr
Shared pointer to a bdd_dict.
Definition: bdddict.hh:304
std::shared_ptr< const twa > const_twa_ptr
Shared pointer to a const twa.
Definition: fwd.hh:36
std::shared_ptr< twa_graph > twa_graph_ptr
Shared pointer to a mutable twa_graph.
Definition: fwd.hh:44
Definition: automata.hh:26
An infinite word stored as a lasso.
Definition: word.hh:35
twa_graph_ptr as_automaton() const
Convert the twa_word as an automaton.
friend std::ostream & operator<<(std::ostream &os, const twa_word &w)
Print a twa_word.
bool intersects(const_twa_ptr aut) const
Check if the twa_word intersects another automaton.
Definition: word.hh:98
void use_all_aps(bdd aps, bool positive=false)
Use all atomic propositions.
bdd_dict_ptr get_dict() const
Return the BDD dictionary.
Definition: word.hh:80
twa_word(const bdd_dict_ptr &dict) noexcept
Construct an empty word with the given BDD dictionary.
twa_word(const twa_run_ptr &run) noexcept
Construct a word from a twa_run.
seq_t prefix
Finite prefix of the word.
Definition: word.hh:76
void simplify()
Simplify a lasso-shaped word.
std::list< bdd > seq_t
Type for a sequence of BDD conditions.
Definition: word.hh:75
seq_t cycle
Infinite repeating cycle of the word.
Definition: word.hh:77