Classes |
class | spot::tgba_kv_complement |
| Build a complemented automaton.The construction comes from: More...
|
class | spot::state_product |
| A state for spot::tgba_product.This state is in fact a pair of state: the state from the left automaton and that of the right. More...
|
class | spot::tgba_safra_complement |
| Build a complemented automaton.It creates an automaton that recognizes the negated language of aut. More...
|
class | spot::tgba_sgba_proxy |
| Change the labeling-mode of spot::tgba on the fly, producing a state-based generalized Büchi automaton.This class acts as a proxy in front of a spot::tgba, that should label on states on-the-fly. The result is still a spot::tgba, but acceptances conditions are also on states. More...
|
class | spot::tgba_tba_proxy |
| Degeneralize a spot::tgba on the fly, producing a TBA.This class acts as a proxy in front of a spot::tgba, that should be degeneralized on the fly. The result is still a spot::tgba, but it will always have exactly one acceptance condition so it could be called TBA (without the G). More...
|
class | spot::tgba_sba_proxy |
| Degeneralize a spot::tgba on the fly, producing an SBA.This class acts as a proxy in front of a spot::tgba, that should be degeneralized on the fly. More...
|
class | spot::state_union |
| A state for spot::tgba_union.This state is in fact a pair. If the first member equals 0 and the second is different from 0, the state belongs to the left automaton. If the first member is different from 0 and the second is 0, the state belongs to the right automaton. If both members are 0, the state is the initial state. More...
|