Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
The problem of complementing Büchi automata arises when developing decision procedures for temporal logics of programs. Unfortunately, previously known constructions for complementing Büchi automata involve a doubly exponential blow-up in the size of the automaton. We present a construction that involves only an exponential blow-up. We use this construction to prove a polynomial space upper bound for the propositional temporal logic of regular events and to prove a complexity hierarchy result for quantified propositional temporal logic. © 1987.
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory