1 code implementation • 17 Jan 2023 • Anej Svete, Benjamin Dayan, Tim Vieira, Ryan Cotterell, Jason Eisner
The pathsum in ordinary acyclic WFSAs is efficiently computed by the backward algorithm in time $O(|E|)$, where $E$ is the set of transitions.
