Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
From MaRDI portal
Publication:4649286
DOI10.1007/978-3-642-33386-6_5zbMath1374.68265OpenAlexW42425946MaRDI QIDQ4649286
Publication date: 21 November 2012
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33386-6_5
Related Items (4)
Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning ⋮ Determinization and limit-determinization of Emerson-Lei automata ⋮ Safraless LTL synthesis considering maximal realizability ⋮ \( \omega \)-automata
This page was built for publication: Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
