@InProceedings{barloy_et_al:LIPIcs.STACS.2021.8,
author = {Barloy, Corentin and Clemente, Lorenzo},
title = {{Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.8},
URN = {urn:nbn:de:0030-drops-136533},
doi = {10.4230/LIPIcs.STACS.2021.8},
annote = {Keywords: unambiguous register automata, universality and inclusion problems, multi-dimensional linear recurrence sequences}
}