@InProceedings{ferens_et_al:LIPIcs.MFCS.2021.46,
author = {Ferens, Robert and Szyku{\l}a, Marek and Vorel, Vojt\v{e}ch},
title = {{Lower Bounds on Avoiding Thresholds}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.46},
URN = {urn:nbn:de:0030-drops-144869},
doi = {10.4230/LIPIcs.MFCS.2021.46},
annote = {Keywords: avoiding word, \v{C}ern\'{y} conjecture, rank conjecture, reset threshold, reset word, synchronizing automaton, synchronizing word}
}