Introduces Emerson-Lei elevator automata and a complementation algorithm with better asymptotic complexity than known methods for unrestricted Emerson-Lei automata.
26 Matthias Heizmann, Jochen Hoenicke, and Andreas Podelski
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complementing Emerson-Lei Elevator Automata (Technical Report)
Introduces Emerson-Lei elevator automata and a complementation algorithm with better asymptotic complexity than known methods for unrestricted Emerson-Lei automata.