Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Vojtěch Havlena and Ondřej Lengál. Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 2:1-2:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{havlena_et_al:LIPIcs.CONCUR.2021.2, author = {Havlena, Vojt\v{e}ch and Leng\'{a}l, Ond\v{r}ej}, title = {{Reducing (To) the Ranks: Efficient Rank-Based B\"{u}chi Automata Complementation}}, booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)}, pages = {2:1--2:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-203-7}, ISSN = {1868-8969}, year = {2021}, volume = {203}, editor = {Haddad, Serge and Varacca, Daniele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.2}, URN = {urn:nbn:de:0030-drops-143799}, doi = {10.4230/LIPIcs.CONCUR.2021.2}, annote = {Keywords: B\"{u}chi automata, rank-based complementation, super-tight runs} }
Feedback for Dagstuhl Publishing