@InProceedings{paul:LIPIcs.STACS.2019.55,
author = {Paul, Erik},
title = {{Finite Sequentiality of Unambiguous Max-Plus Tree Automata}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {55:1--55:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-100-9},
ISSN = {1868-8969},
year = {2019},
volume = {126},
editor = {Niedermeier, Rolf and Paul, Christophe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.55},
URN = {urn:nbn:de:0030-drops-102946},
doi = {10.4230/LIPIcs.STACS.2019.55},
annote = {Keywords: Weighted Tree Automata, Max-Plus Tree Automata, Finite Sequentiality, Decidability, Ambiguity}
}