@inproceedings{havlena_et_al:LIPIcs.CONCUR.2021.2,
Address = {Dagstuhl, Germany},
Annote = {Keywords: B\"{u}chi automata, rank-based complementation, super-tight runs},
Author = {Havlena, Vojt\v{e}ch and Leng\'{a}l, Ond\v{r}ej},
BookTitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
Editor = {Haddad, Serge and Varacca, Daniele},
File = {Reducing (To) the Ranks- Efficient Rank-Based Büchi Automata Complementation - LIPIcs-CONCUR-2021-2.pdf},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
Pages = {2:1--2:19},
Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Reducing (To) the Ranks: Efficient Rank-Based B\"{u}chi Automata Complementation}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14379},
Volume = {203},
Year = {2021},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2021/14379},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.CONCUR.2021.2},
date-added = {2021-08-17 16:18:08 +0200},
date-modified = {2021-08-17 16:18:08 +0200},
urn = {urn:nbn:de:0030-drops-143799},
doi = {10.4230/LIPIcs.CONCUR.2021.2}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A