@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2023.33,
author = {Bertrand, Cl\'{e}ment and Di Giusto, Cinzia and Klaudel, Hanna and Regnault, Damien},
title = {{Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata}},
booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)},
pages = {33:1--33:17},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.33},
URN = {urn:nbn:de:0030-drops-190277},
doi = {10.4230/LIPIcs.CONCUR.2023.33},
annote = {Keywords: memory automata, \nu-automata, LaMA, HRA, complexity, non-emptiness, membership}
}