Efficient removal of spontaneous transitions in Vcsn

From LRDE

Revision as of 17:06, 9 January 2018 by Bot (talk | contribs) (Created page with "{{CSIReport | authors = Antoine Pietri | title = Efficient removal of spontaneous transitions in Vcsn | year = 2015 | number = 1504 | abstract = This report exposes some perfo...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.