License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2020.137
URN: urn:nbn:de:0030-drops-125447
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12544/
Paul, Erik
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
Abstract
We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant. 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:2020:12544,
author = {Erik Paul},
title = {{Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata}},
booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
pages = {137:1--137:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
year = {2020},
volume = {168},
editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12544},
URN = {urn:nbn:de:0030-drops-125447},
doi = {10.4230/LIPIcs.ICALP.2020.137},
annote = {Keywords: Weighted Tree Automata, Max-Plus Tree Automata, Finite Sequentiality, Decidability, Finite Ambiguity}
}
Keywords: |
|
Weighted Tree Automata, Max-Plus Tree Automata, Finite Sequentiality, Decidability, Finite Ambiguity |
Collection: |
|
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
29.06.2020 |