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

Tools

Daviaud, Laure and Purser, David (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). UNSPECIFIED. (In Press)

[thumbnail of BigOProblemMaxPlusAutomataIsDecidable]

PDF (BigOProblemMaxPlusAutomataIsDecidable) - Accepted Version
Restricted to Repository staff only until 31 December 2099.

Item Type:	Book Section
Uncontrolled Keywords:	4* ,/dk/atira/pure/researchoutput/REFrank/4_
Related URLs:	https://arxiv.org/abs/2304.05229
Depositing User:	LivePure Connector
Date Deposited:	14 Jun 2023 14:26
Last Modified:	14 Jun 2023 14:26
URI:	https://ueaeprints.uea.ac.uk/id/eprint/92392
DOI:

Actions (login required)

View Item