The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable.

Erik Paul

Browse the full MFCS paper archive.