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

Laure Daviaud, David Purser, Marie Tcheng

We show that the big-O problem for max-plus automata is decidable and PSPACE-complete. The big-O (or affine domination) problem asks whether, given two max-plus automata computing…