English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We study the problem of determinizing $\omega$-automata whose acceptancecondition is defined on the transitions using Boolean formulas, also known astransition-based Emerson-Lei automata (TELA). The standard approach todeterminize TELA first constructs an equivalent generalized B\"uchi automaton(GBA), which is later determinized. We introduce three new ways of translatingTELA to GBA. Furthermore, we give a new determinization construction whichdeterminizes several GBA separately and combines them using a productconstruction. An experimental evaluation shows that the product approach iscompetitive when compared with state-of-the-art determinization procedures. Wealso study limit-determinization of TELA and show that this can be done with asingle-exponential blow-up, in contrast to the known double-exponentiallower-bound for determinization. Finally, one version of thelimit-determinization procedure yields good-for-MDP automata which can be usedfor quantitative probabilistic model checking.

Determinization and Limit-determinization of Emerson-Lei automata