@inproceedings{ClementeDontenBuryMazowieckiPilipczuk:STACS:23,
Address = {Dagstuhl, Germany},
Annote = {Keywords: recursive sequences, polynomial automata, zeroness problem, equivalence problem},
Author = {Clemente, Lorenzo and Donten-Bury, Maria and Mazowiecki, Filip and Pilipczuk, Micha{{\l}}},
BookTitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)},
Editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha},
File = {On Rational Recursive Sequences - LIPIcs-STACS-2023-24 - a.pdf},
ISBN = {978-3-95977-266-2},
ISSN = {1868-8969},
Pages = {24:1--24:21},
Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{On Rational Recursive Sequences}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17676},
Volume = {254},
Year = {2023},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2023/17676},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.STACS.2023.24},
date-added = {2023-03-03 07:27:57 +0100},
date-modified = {2023-05-24 12:27:00 +0200},
urn = {urn:nbn:de:0030-drops-176763},
doi = {10.4230/LIPIcs.STACS.2023.24}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 07:51:09,
Build Time: N/A