 | Up a level |
Number of items: 2.
Daviaud, Laure, Jurdzinski, Marcin and Lehtinen, MK 
ORCID: 0000-0003-1171-8790
(2019)
Alternating weak automata from universal trees.
In: 30th International Conference on Concurrency Theory.
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.