WFSC - A new weighted finite state compiler
Andre Kempe, Christof Baeijs, Tamas Gaal, Franck Guingne, Florent Nicart
This article presents a new tool, WFSC, for creating, manipulating, and applying weighed finite state automata.
It inherits some powerful features from Xerox non-weighted XFST tool and represents a continuation of
Xerox work in the field of finte state automata over two decades. The design is generic: algorithms work on
abstract components of automata and on a generic abstract semiring, and are independent of their concrete
realizations. Applications can access WFSC functions through an API or create automata through an
end-user interface, either from an enumeration of their states and transitions or from regular expressions.
8th Int. Conf. on Implementation and Application of Automata (CIAA 03), Santa Barbara, CA, USA, July 16-18,
2003. volume 2759 of Lecture Notes in Computer Science, Springer Verlag, pages 108-119.