@inproceedings{ferens_et_al:LIPIcs.ICALP.2023.59,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: \v{C}ern\'{y} conjecture, complete reachability, DFA, extending word, reachability, reset threshold, reset word, simple idempotent, synchronizing automaton, synchronizing word},
    Author = {Ferens, Robert and Szyku{\l}a, Marek},
    BookTitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
    Editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
    File = {Completely Reachable Automata- A Polynomial Algorithm and Quadratic Upper Bounds - LIPIcs-ICALP-2023-59.pdf},
    ISBN = {978-3-95977-278-5},
    ISSN = {1868-8969},
    Pages = {59:1--59:17},
    Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds}},
    URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18111},
    Volume = {261},
    Year = {2023},
    bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2023/18111},
    bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ICALP.2023.59},
    date-added = {2023-07-06 08:06:05 +0200},
    date-modified = {2023-07-06 08:06:05 +0200},
    urn = {urn:nbn:de:0030-drops-181110},
    doi = {10.4230/LIPIcs.ICALP.2023.59}
}

@inproceedings{ferens_et_al:LIPIcs.ICALP.2023.59, Address = {Dagstuhl, Germany}, Annote = {Keywords: \v{C}ern\'{y} conjecture, complete reachability, DFA, extending word, reachability, reset threshold, reset word, simple idempotent, synchronizing automaton, synchronizing word}, Author = {Ferens, Robert and Szyku{\l}a, Marek}, BookTitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, Editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, File = {Completely Reachable Automata- A Polynomial Algorithm and Quadratic Upper Bounds - LIPIcs-ICALP-2023-59.pdf}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, Pages = {59:1--59:17}, Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds}}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18111}, Volume = {261}, Year = {2023}, bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2023/18111}, bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ICALP.2023.59}, date-added = {2023-07-06 08:06:05 +0200}, date-modified = {2023-07-06 08:06:05 +0200}, urn = {urn:nbn:de:0030-drops-181110}, doi = {10.4230/LIPIcs.ICALP.2023.59} }