1. Vector algorithms for approximate string matching;Bergeron;Internat. J. Foundations of Comput. Sci.,2002
2. Algebraic theory of machines;Krohn;Trans. Amer. Math. Soc.,1965
3. O. Maler, A. Pnueli, Tight bounds on the complexity of cascaded decomposition theorem, 31st Annu. Symp. on Foundations Computer Science IEEE, Vol. II, St-Louis, Missouri, USA, 1990, pp. 672–682.
4. O. Maler, A. Pnueli, On the Cascaded Decomposition of Automata, its Complexity and its Application to Logic, 1994, 48pp., unpublished manuscript available at http://www-verimag.imag.fr/PEOPLE/maler/uabst.html.
5. A fast bit-vector algorithm for approximate string matching based on dynamic programming;Myers;J. ACM,1999