@InProceedings{manzini_et_al:LIPIcs.CPM.2024.23,
author = {Manzini, Giovanni and Policriti, Alberto and Prezza, Nicola and Riccardi, Brian},
title = {{The Rational Construction of a Wheeler DFA}},
booktitle = {35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-326-3},
ISSN = {1868-8969},
year = {2024},
volume = {296},
editor = {Inenaga, Shunsuke 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.CPM.2024.23},
URN = {urn:nbn:de:0030-drops-201336},
doi = {10.4230/LIPIcs.CPM.2024.23},
annote = {Keywords: String Matching, Deterministic Finite Automata, Wheeler languages, Graph Indexing, Co-lexicographical Sorting}
}