The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)

Daviaud, Laure and Purser, David ORCID: 0000-0003-0394-1634
(2023) The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). In: Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2023-6-26 - 2023-6-29, Boston, USA.

[img] Text
licsnc.pdf - Author Accepted Manuscript

Download (396kB) | Preview
Item Type: Conference or Workshop Item (Unspecified)
Additional Information: “© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 18 Apr 2023 09:33
Last Modified: 15 Mar 2024 19:59
DOI: 10.1109/LICS56636.2023.10175798
Related URLs: