Add to ORKGWe show that the termination of Mohri's algorithm is decidable for polynomially ambiguous weighted finite automata over the tropical semiring which gives a partial answer to a question by Mohri [29]. The proof relies on an improvement of the notion of the twins property and a Burnside type characterization for the finiteness of the set of states produced by Mohri's algorithm
We show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata....
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
We show that the termination of Mohri's algorithm is decidable for polynomially ambiguous weighted f...
AbstractWe solve a problem already investigated by Mohri in 1997: we show that the twins property fo...
International audienceThis paper solves the unambiguity and the sequentiality problem for polynomial...
This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus ...
In the paper, we generalize an algorithm and some related results by Mohri [25] for deter-minization...
AbstractWe solve a problem already investigated by Mohri in 1997: we show that the twins property fo...
International audienceThis paper solves the unambiguity and the sequentiality problem for polynomial...
We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree auto...
Part 2: Track B: Logic, Semantics, Specification and VerificationInternational audienceIn this paper...
We present three pumping lemmas for three classes of functions definable by fragments of weighted au...
Weighted automata map input words to numerical values. Ap- plications of weighted automata include f...
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
We show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata....
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
We show that the termination of Mohri's algorithm is decidable for polynomially ambiguous weighted f...
AbstractWe solve a problem already investigated by Mohri in 1997: we show that the twins property fo...
International audienceThis paper solves the unambiguity and the sequentiality problem for polynomial...
This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus ...
In the paper, we generalize an algorithm and some related results by Mohri [25] for deter-minization...
AbstractWe solve a problem already investigated by Mohri in 1997: we show that the twins property fo...
International audienceThis paper solves the unambiguity and the sequentiality problem for polynomial...
We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree auto...
Part 2: Track B: Logic, Semantics, Specification and VerificationInternational audienceIn this paper...
We present three pumping lemmas for three classes of functions definable by fragments of weighted au...
Weighted automata map input words to numerical values. Ap- plications of weighted automata include f...
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
We show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata....
We consider the computability and complexity of decision questions for Probabilistic Finite Automata...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...