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

Laure Daviaud, David Purser

Browse the full LICS paper archive.