Tight Bounds for Complementing Parity Automata
Formal Languages and Automata Theory
2014-09-12 v1
Abstract
We follow a connection between tight determinisation and complementation and establish a complementation procedure from parity automata to nondeterministic B\"uchi automata and prove it to be tight up to an factor, where is the size of the nondeterministic parity automaton. This factor does not depend on the number of priorities.
Keywords
Cite
@article{arxiv.1406.1090,
title = {Tight Bounds for Complementing Parity Automata},
author = {Sven Schewe and Thomas Varghese},
journal= {arXiv preprint arXiv:1406.1090},
year = {2014}
}
Comments
Full version of paper accepted for publication at MFCS 2014