The Removal of Weighted ε-Transitions

Sylvain Lombardy (1) , Jacques Sakarovitch (2)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 LTCI - Laboratoire Traitement et Communication de l'Information

The removal of ε-transitions in weighted automata leads to infinite summation when cycles of such transitions are allowed. This paper presents both an algorithm for that purpose, and a framework in which the algorithm is correct.

Domaines: Mathématique discrète [cs.DM]

Sylvain Lombardy, Jacques Sakarovitch. The Removal of Weighted ε-Transitions. 17th International Conference, CIAA 2012, 2012, Porto, Portugal. pp.345-352, ⟨10.1007/978-3-642-31606-7_31⟩. ⟨hal-00737679⟩