If Schanuel's conjecture holds then the containment problem is decidable if at least one of the input automata is unambiguous while the other is finitely ambiguous.
▷ Theorem 2. If Schanuel's conjecture holds then the containment problem is decidable for the class of finitely ambiguous probabilistic automata, provided that ...
We show that a gap version of the emptiness problem (known to be undecidable in general) becomes decidable for automata of polynomial ambiguity. We complement ...
Apr 24, 2018 · We show that a gap version of the emptiness problem (that is known be undecidable in general) becomes decidable for automata of polynomial ...
Feb 9, 2021 · Theorem 2. The emptiness and containment problems are undecidable for the class of linearly ambiguous probabilistic automata. Theorem 2 ...
When either A or B is at least linearly ambiguous. Undecidable. When A and B are finitely ambiguous and one is unambiguous. Decidable.
This work shows decidability (subject to Schanuel's conjecture) when one of the automata is assumed to be unambiguous while the other one is allowed to be ...
Apr 16, 2018 · We study it for probabilistic automata, where it is known to be undecidable in general. We restrict our study to the class of probabilistic ...
Jul 4, 2018 · We study it for probabilistic automata, where it is known to be undecidable in general. We restrict our study to the class of probabilistic ...
The containment problem for quantitative automata is the natural quantitative generalisation of the classical language inclusion problem for Boolean automata.