Efficient removal of spontaneous transitions in Vcsn
From LRDE
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
- Authors
- Antoine Pietri
- Type
- techreport
- Year
- 2015
- Number
- 1504
Abstract
This report exposes some performant and generic ways to implement removal of spontaneous transitions in an -NFA. We compare two different approches: the weighted -closure algorithm of J. Sakarovitch and S. Lombardy, and the -removal algorithm of M. Mohri. We discuss how these algorithm can be implemented when dealing with generic weighted automata, and their implications on performance by comparing some empirical results obtained in Vcsn.
