55 research outputs found
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
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
Finite Sequentiality of Unambiguous Max-Plus Tree Automata
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
Recommended from our members
Register complexity and determinisation of max-plus automata
We survey some results about the sequentiality problem for max-plus automata and its generalisation, the register complexity problem for cost register automata. We compare classes of functions computed by maxplus automata and by cost register automata with respect to the notion of ambiguity. The two models are introduced gently, so the novice reader is welcome
The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable
We show that the equivalence, unambiguity and sequentiality problems are decidable for finitely ambiguous max-plus tree automata
Recommended from our members
Containment and equivalence of weighted automata: Probabilistic and max-plus cases
This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps from words to real values. Given two weighted automata, the equivalence problem asks whether their semantics are the same, and the containment problem whether one is point-wise smaller than the other one. These problems have been studied intensively and this paper will review some techniques used to show (un)decidability and state a list of open questions that still remain
Unambiguous Separators for Tropical Tree Automata
In this paper we show that given a max-plus automaton (over trees, and with real weights) computing a function f and a min-plus automaton (similar) computing a function g such that f ? g, there exists effectively an unambiguous tropical automaton computing h such that f ? h ? g.
This generalizes a result of Lombardy and Mairesse of 2006 stating that series which are both max-plus and min-plus rational are unambiguous. This generalization goes in two directions: trees are considered instead of words, and separation is established instead of characterization (separation implies characterization). The techniques in the two proofs are very different
Series which are both max-plus and min-plus rational are unambiguous
Consider partial maps from the free monoid into the field of real numbers
with a rational domain. We show that two families of such series are actually
the same: the unambiguous rational series on the one hand, and the max-plus and
min-plus rational series on the other hand. The decidability of equality was
known to hold in both families with different proofs, so the above unifies the
picture. We give an effective procedure to build an unambiguous automaton from
a max-plus automaton and a min-plus one that recognize the same series
A Robust Class of Linear Recurrence Sequences
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several characterisations: polynomially ambiguous weighted automata, copyless cost-register automata, rational formal series, and linear recurrence sequences whose eigenvalues are roots of rational numbers
On Determinism and Unambiguity of Weighted Two-way Automata
In this paper, we first study the conversion of weighted two-way automata to
one-way automata. We show that this conversion preserves the unambiguity but
does not preserve the determinism. Yet, we prove that the conversion of an
unambiguous weighted one-way automaton into a two-way automaton leads to a
deterministic two-way automaton. As a consequence, we prove that unambiguous
weighted two-way automata are equivalent to deterministic weighted two-way
automata in commutative semirings.Comment: In Proceedings AFL 2014, arXiv:1405.527
- …