1. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)
2. Mohri, M.: Weighted Automata Algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, pp. 209–252. Springer, Heidelberg (2009)
3. Mohri, M., Pereira, F.C.N., Riley, M.: The design principles of a weighted finite-state transducer library. Theoret. Comput. Sci. 231(1), 17–32 (2000)
4. Kaplan, R.M., May, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)
5. Kanthak, S., Ney, H.: Fsa: an efficient and flexible C + + toolkit for finite state automata using on-demand computation. In: Proc. ACL, pp. 510–517 (2004)