Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
Keyword(s):
AbstractWe 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.
2018 ◽
Vol 52
(1)
◽
pp. 23-42
◽
Keyword(s):
2005 ◽
Vol 16
(04)
◽
pp. 723-741
◽
Keyword(s):
2013 ◽
Vol 24
(06)
◽
pp. 815-830
◽
Keyword(s):
2021 ◽
Vol vol. 23 no. 1
(Automata, Logic and Semantics)
◽