Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
On strong stability and higher-order sequentiality
Sequentiality and strong stability
Finite Sequentiality of Unambiguous Max-Plus Tree Automata
The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable