Discrete Mathematics & Theoretical Computer Science, Vol 7 (2005)

Font Size:  Small  Medium  Large

Algebraic elimination of ε-transitions

Gérard H. E. Duchamp, Hatem Hadj Kacem, Éric Laugerotte


We here describe a method of removing the ε-transitions of a weighted automaton. The existence of a solution for this removal depends on the existence of the star of a single matrix which, in turn, is based on the computation of the stars of scalars in the ground semiring. We discuss two aspects of the star problem (by infinite sums and by equations) and give an algorithm to suppress the ε-transitions and preserve the behaviour. Running complexities are computed.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page