Jan 27, 2015 · We study the problem of constructing approximations to a weighted automaton. Weighted finite automata (WFA) are closely related to the theory of rational ...

Abstract—We study the problem of constructing approxima- tions to a weighted automaton. Weighted finite automata (WFA) are closely related to the theory of ...

The goal of the approximate minimization algorithm is to start from a minimal WFA and produce a smaller WFA that is close to the given one in a certain ...

Jun 14, 2015 · The goal of our approximate minimization algorithm is to start from a minimal WFA and produce a smaller WFA that is close to the given one in a ...

A Canonical Form for Weighted Automata and Applications to Approximate Minimization. Authors: Borja Balle. Borja Balle. View Profile. , Prakash Panangaden.

A Canonical Form for Weighted Automata and Applications to Approximate Minimization LICS, 2015. LICS 2015 · DBLP · Scholar · DOI. Full names. Links ISxN.

The approximate minimization problem is concerned with finding an automaton that approximates the behaviour of a given minimal WFA, while being smaller in ...

The goal of our approximate minimization algorithm is to start from a minimal WFA and produce a smaller WFA that is close to the given one in a certain sense.

Borja Balle, Prakash Panangaden, Doina Precup: A Canonical Form for Weighted Automata and Applications to Approximate Minimization.

In this paper we take a similar approach and show that in the tree case one can obtain an analogous canonical form that we call singular value tree automata, ...