@InProceedings{michaliszyn_et_al:LIPIcs.CONCUR.2023.3,
author = {Michaliszyn, Jakub and Otop, Jan and Wieczorek, Piotr},
title = {{Reachability and Bounded Emptiness Problems of Constraint Automata with Prefix, Suffix and Infix}},
booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)},
pages = {3:1--3:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-299-0},
ISSN = {1868-8969},
year = {2023},
volume = {279},
editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.3},
URN = {urn:nbn:de:0030-drops-189971},
doi = {10.4230/LIPIcs.CONCUR.2023.3},
annote = {Keywords: constraint automata, emptiness problem}
}