A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Please cite this article in press as: H. Björklund et al., Compression of finite-state automata through failure transitions, Theor. Comput. Sci. (2014), http://dx. Abstract Several linear-time algorithms for automata-based pattern matching rely on failure transitions for efficient back-tracking. Like epsilon transitions, failure transition do not consume input symbols, but unlike them, they may only be taken when no other transition is applicable. At a semantic level, this conveniently modelsdoi:10.1016/j.tcs.2014.09.007 fatcat:4g63q4ix7vfwdikhg2s25j7d34