Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2019.55
URN: urn:nbn:de:0030-drops-102946
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10294/
Paul, Erik
Finite Sequentiality of Unambiguous Max-Plus Tree Automata
| pdf-format: |
|
Abstract
We show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata. A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree automata whose pointwise maximum is equivalent to the given automaton.
BibTeX - Entry
@InProceedings{paul:LIPIcs:2019:10294,
author = {Erik Paul},
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 = {Rolf Niedermeier and Christophe Paul},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10294},
doi = {10.4230/LIPIcs.STACS.2019.55},
annote = {Keywords: Weighted Tree Automata, Max-Plus Tree Automata, Finite Sequentiality, Decidability, Ambiguity}
}
| Keywords: | Weighted Tree Automata, Max-Plus Tree Automata, Finite Sequentiality, Decidability, Ambiguity | |
| Seminar: | 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 12.03.2019 |
