Abstract
We follow a connection between tight determinisation and complementation and establish a complementation procedure from transition labelled parity automata to transition labelled nondeterministic Büchi automata. We prove it to be tight up to an O(n) factor, where n is the size of the nondeterministic parity automaton. This factor does not depend on the number of priorities. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Schewe, S., & Varghese, T. (2014). Tight bounds for complementing parity automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8634 LNCS, pp. 499–510). Springer Verlag. https://doi.org/10.1007/978-3-662-44522-8_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
