@InProceedings{becker_et_al:LIPIcs.ESA.2023.15,
author = {Becker, Ruben and C\'{a}ceres, Manuel and Cenzato, Davide and Kim, Sung-Hwan and Kodric, Bojana and Olivares, Francisco and Prezza, Nicola},
title = {{Sorting Finite Automata via Partition Refinement}},
booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-295-2},
ISSN = {1868-8969},
year = {2023},
volume = {274},
editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.15},
URN = {urn:nbn:de:0030-drops-186684},
doi = {10.4230/LIPIcs.ESA.2023.15},
annote = {Keywords: Wheeler automata, prefix sorting, pattern matching, graph compression, sorting, partition refinement}
}