Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
From MaRDI portal
Publication:4649286
Recommendations
- Tighter Bounds for the Determinisation of Büchi Automata
- Complementing deterministic Büchi automata in polynomial time
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- Determinization of Büchi-Automata
- scientific article; zbMATH DE number 1408338
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- On the complementation of Büchi automata
- On complementing nondeterministic Büchi automata
- Complementation of finitely ambiguous Büchi automata
- Implementation and Application of Automata
Cited in
(15)- Safraless LTL synthesis considering maximal realizability
- Bound problems in predicate networks and networks of weakly initial automata
- -automata
- Determinization and limit-determinization of Emerson-Lei automata
- Seminator 2 can complement generalized Büchi automata via improved semi-determinization
- Tight bounds for complementing parity automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Tighter Bounds for the Determinisation of Büchi Automata
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- Determinization and Complementation of Streett Automata
- Good-for-MDPs automata for probabilistic analysis and reinforcement learning
- Complementation of Emerson-Lei automata
- Structural reductions and stutter sensitive properties
- A tighter analysis of Piterman's Büchi determinization
This page was built for publication: Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649286)
