2021
DOI: 10.48550/arxiv.2106.15892
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Determinization and Limit-determinization of Emerson-Lei automata

Abstract: We study the problem of determinizing ω-automata whose acceptance condition is defined on the transitions using Boolean formulas, also known as transition-based Emerson-Lei automata (TELA). The standard approach to determinize TELA first constructs an equivalent generalized Büchi automaton (GBA), which is later determinized. We introduce three new ways of translating TELA to GBA. Furthermore, we give a new determinization construction which determinizes several GBA separately and combines them using a product … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 28 publications
(70 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?