State of B\"uchi Complementation
Complementation of B\"uchi automata has been studied for over five decades since the formalism was introduced in 1960. Known complementation constructions can be classified into Ramsey-based, determinization-based, rank-based, and slice-based approaches. Regarding the performance of these appro...
Main Authors: | Ming-Hsien Tsai, Seth Fogarty, Moshe Y. Vardi, Yih-Kuen Tsay |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2014-12-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1059/pdf |
Similar Items
Similar Items
-
Unifying B\"uchi Complementation Constructions
by: Seth J. Fogarty, et al.
Published: (2013-03-01) -
B\"uchi Complementation and Size-Change Termination
by: Seth Fogarty, et al.
Published: (2012-02-01) -
Half-Positional Objectives Recognized by Deterministic B\"uchi Automata
by: Patricia Bouyer, et al.
Published: (2024-08-01) -
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
by: Joost Engelfriet, et al.
Published: (2020-08-01) -
From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
by: Nir Piterman
Published: (2007-08-01)