Determinising Parity Automata
release_bgbjd2xtsvefdnpikqgs4nhfze
by
Sven Schewe, Thomas Varghese
2014
Abstract
Parity word automata and their determinisation play an important role in
automata and game theory. We discuss a determinisation procedure for
nondeterministic parity automata through deterministic Rabin to deterministic
parity automata. We prove that the intermediate determinisation to Rabin
automata is optimal. We show that the resulting determinisation to parity
automata is optimal up to a small constant. Moreover, the lower bound refers to
the more liberal Streett acceptance. We thus show that determinisation to
Streett would not lead to better bounds than determinisation to parity. As a
side-result, this optimality extends to the determinisation of B\"uchi
automata.
In text/plain
format
Archived Files and Locations
application/pdf 434.9 kB
file_3dc3oa5oezhovcajzupo3vra5q
|
arxiv.org (repository) web.archive.org (webarchive) |
1401.5394v1
access all versions, variants, and formats of this works (eg, pre-prints)