Index appearance record with preorders

Jan Křetínský, Tobias Meggendorfer, Clara Waldmann, Maximilian Weininger

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


Transforming ω-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches.

Original languageEnglish
Pages (from-to)585-618
Number of pages34
JournalActa Informatica
Issue number5
StatePublished - Oct 2022


Dive into the research topics of 'Index appearance record with preorders'. Together they form a unique fingerprint.

Cite this